SJES 2236
Introduction to Operational Research
Tutorial 8
1.
Determine the saddle-point solution, the associated pure strategies, and the value of
the game for each of the following games. The payoffs are for player A.
(a)
Player A
A1
A2
A3
B1
8
Player B

SJES 2236
Introduction to Operational Research
Tutorial 2
1.
The Pinewood Furniture Company produces chairs and tables from two resourceslabor and wood. The company has 80 hours of labor and 36 pounds of wood
available each day. Demand for chairs is limit

SJES 2236
Introduction to Operational Research
Tutorial 6
1.
In a job shop operation, four jobs may be performed on any of four machines. The
number of hours required for each job on each machine is summarized below. What is
the minimum total time job-mac

SJES 2236
Introduction to Operational Research
Tutorial 5
1.
Suppose a manufacturer of small electrical machinery has three manufacturing
plants in the United States and five regional warehouses to which he ships his
product storage and further distributi

Chapter 5 : Game theory
SJEM 2233 : Basic Operational Research
Chapter 5 : Game Theory
Games theory deals with decision situations in which two intelligent opponents have
conflicting objectives.
Typical examples include launching advertisement campaigns f

SJEM 2233 : Basic Operational Research
Chapter 6 : Dynamic Programming
SJES 2236
Introduction to Operational Research
Tutorial 9
1.
The owner of a chain of three grocery stores has purchased five crates of fresh
strawberries. The estimated probability dis

SJES 2236
Introduction to Operational Research
Tutorial 1
1. Maju Jaya Inc. is planning a campaign to introduce children toys in three different
Medias: television, radio and magazines. The aim of the campaign is to introduce the
product to as many custom

SJES 2236
Introduction to Operational Research
Tutorial 7
Solve the following Integer Linear Programming by the Branch and Bound method.
(a)
Maximize z = 7 x1 + 3 x 2
Subject to
2 x 1 + 5 x 2 30
8 x1 + 3 x 2 48
x 1 , x 2 0 ; x 1 , x 2 integer
(b)
Maximize

SJES 2236
Introduction to Operational Research
Tutorial 4
Solve the following Linear Programming Problems by the two-phase method.
(a)
Minimize z 4 x1 3 x 2 3 x 3 4 x 4
Subject to
3 x1 8 x 2
x4
120
5 x1 2 x 2 x 3 2 x 4
200
x2 2 x3
135
x1 , x 2 , x 3 ,