3.4-7. Consider the following problem, where the value of c1 has not yet been ascertained.

Maximize: Z  c1 x1  2x 2

Subject to

41  x 2  12
x1  x 2  2

and

x1  0 , x 2  0

Use graphical analysis to determine the optimal solution(s) for ( x1 , x 2 ) for the various possible
values of c1 .

Solution:

The feasible region can be represented as follows:

Given c 2 = 2 > 0, various cases that may arise are summarized in the following table:

c1
c1 Slope =  Optimal solution ( x1 , x 2 )
c2

c1
c1 < -2 1<  (2, 0)
c2

(2, 0),  ,  and all points

14 4
c1  5 5
c1 = -2  =1
c2 on the line connecting these
two

-12 < 
c1  14 4 
-2 < c1 < 24 <1  , 
c2  5 5

 14 4 
 ,  , (3, 0) and all the
c1  5 5
c1 = 24  = -12
c2 points on the line connecting
these two
c1
24 < c1  < -12 (3, 0)
c2