Linear Programming Solutions

Tutorial questions
Problem 1 Minimize Z= X1 + 3X2
Subject to
5X1 + 4X2  20
3X1 + 4X2  24
X1  0, X2  0

 Identify the Feasible region on a graphical representation of the problem.

 Determine the optimal solution from the Graph for this problem.

 What would be the optimal solution if the objective function were to be

maximized?

 The optimal solution from a graph by the corner point of the feasible
region that is
 (I) nearest to origin for a minimization problem,
 (ii) Farthest from the origin for a maximization problem.

– Is the above statement supported by this problem?

– Is the statement true? Why or why not?

Problem 2

Consider the following linear programming problem?

Minimize Z = X1 - X2
Subject to
X1 + X2  2
X1+ 2X2  8
X1  0, X2  0
Identify the feasible region on a graphical representation of the
problem and answer the following questions:
 What is the optimal solution to
(i) the given problem

(ii) When the objective function is maximize

Z = X 1 + X2 ?

(iii) When X1 and X2 are unrestricted in sign?

 How should the constraint (I) be altered so that a feasible

unbounded solution would exist for condition (iii) above for
both cases (I) and (ii)
Problem 3

Consider the following linear programming problem:

Maximize Z = X1 - X2
Subject to
X1 - 2X2  4
2X1 - X2  -2
X1  0, X2  0
Plot the feasible region on a graph and answer the
following questions based on the graph.

 Does a feasible Finite Optimum exist

– to the given problem?
– When the objective function is Minimize Z = X1 + X2
– When a third constraint X1 + X2  4 is added to the
problem
– When X2 is unrestricted in sign?
 Give reasons for your answers
Problem 4

Consider the following linear programming problem

Maximize Z = 3X1 + 2X2 + 5X3
Subject to
X1 + 2X2 + 2X3  8
3X1 + 2X2 + 6X3  12
2X1 + 3X2 + 4X3  12
X1  0, X2  0, X3  0

Solve this problem by the simplex method

Does this problem have an alternate optimum? If not,

state reasons. If yes, find the alternate optimal solution.

The validity of one of the steps in Simplex method

becomes questionable as you work out this problem.
What is this step?
Problem 6

A simplex tableau is given below in tabular form:

_________________________________________________
Cj 3 2 0 0 0
--------------------------------------
CB Basis X1 X2 X3 X4 X5 b Ratio
---------------------------------------------------------------------
0 X3 0 1 1 0 1 7 7
0 X4 0 5 0 1 -3 5 1
3 X1 1 -1 0 0 1 3 ---
---------------------------------------------------------------------
Cj – Zj 0 5 0 0 -3 z=9
---------------------------------------------------------------------

Perform the next iteration and get the new simplex tableau.
Has the optimal solution been reached?
Problem 7

 In the simplex tableau for maximization problem given below,

the values of six constants 1, 2, 3 , , 1 and 2 are
unknown.

(Assume there are no artificial variables)

---------------------------------------------------------------------------
X1 X2 X3 X4 X5 X6 b
---------------------------------------------------------------------------
X3 4 1 1 0 2 0 
X4 -1 -5 0 1 -1 0 2
X6 3 -3 0 0 -4 1 3
--------------------------------------------------------------------------
Cj – Zj 1 2 0 0 -3 0
--------------------------------------------------------------------------
X1, X2 ……X6  0

State the restrictions on the six unknowns (1, 2, 3 , , 1, and 2),
which would make the following statements true about the given
tableau (Sub. Divisions are independent of each other).