Question: 1 1 i ) Consider the problem: max, z = x 1 + 3 x 2 s . t . x 1 - 2 x

11 i) Consider the problem:
max,z=x1+3x2
s.t.x1-2x20
,-2x1+x24
,5x1+3x215
,x10,x20
a) Draw the feasible region, clearly indicating the constraints, slack variables associated with
each constraint, and normal to the objective function at the origin.
b) Solve the problem graphically. Show the contours of the objective function at the optimum.
c) Solve the problem using the tabular form of the simplex method and write down the basis
matrix B and its inverse B-1 at each iteration.
ii) For the linear program in part (i), associate dual variables to each constraint, and write the
corresponding dual formulation.
a) Solve this dual problem using the two-phase method.
b) Verify that the optimal objective function value obtained in part (i) and (ii)(a) are the
same and show that the optimal values of the dual variables can be obtained from the
simplex tableau of part (i).
c) Write the KKT conditions for the linear program in part (i) and determine the optimal
values to the primal and dual problems by solving the KKT conditions.
d) Verify that the optimal solutions to the primal and dual problems can be obtained directly
from the KKT conditions.
 11 i) Consider the problem: max,z=x1+3x2 s.t.x1-2x20 ,-2x1+x24 ,5x1+3x215 ,x10,x20 a)

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!