Scribd
Upload
107 views2 pages

ME421: IEOR Assignment 03: Special Cases of LP and Sensitivity Analysis Department of Mechanical Engineering, IIT Guwahati

The document provides instructions for four linear programming problems involving special cases such as degeneracy, alternate optima, unbounded solutions, and infeasible solutions. It also describes a linear programming problem to determine the optimal product mix for a company producing three products with constraints on available manpower and raw materials. The optimal product mix and profit are to be found, as well as the effect of changes to right-hand sides, objective function coefficients, and dual prices.

Uploaded by

Ashish Meena
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
107 views2 pages

ME421: IEOR Assignment 03: Special Cases of LP and Sensitivity Analysis Department of Mechanical Engineering, IIT Guwahati

The document provides instructions for four linear programming problems involving special cases such as degeneracy, alternate optima, unbounded solutions, and infeasible solutions. It also describes a linear programming problem to determine the optimal product mix for a company producing three products with constraints on available manpower and raw materials. The optimal product mix and profit are to be found, as well as the effect of changes to right-hand sides, objective function coefficients, and dual prices.

Uploaded by

Ashish Meena
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

ME421: IEOR

Assignment 03: Special Cases of LP and Sensitivity Analysis


Department of Mechanical Engineering, IIT Guwahati

1. Write the following LP model into the equation form for simplex method
=3 + 2 +
ℎ
2 + 5 + = 12, 3 + 4 = 11,
, ≥ 0, ".
HINT: one variable is unrestricted and use proper type of variables for ‘=’ constraints.

2. Solve the following LP problem using the simplex method, and comment on the special
cases like degeneracy, alternate optima, unbounded solution, infeasible solution etc.
a.
=5 + 3

+ ≤ 2, 5 + 2 ≤ 10, 3 + 8 ≤ 12,
, ≥ 0.
b.
=6 + 3

2 + ≤ 8, 3 + 3 ≤ 18, ≤ 3,
, ≥ 0.

c.
= −2 + 3

≤ 5, 2 − 3 ≤ 6,
, ≥ 0.

d.
=2 + 3

− ≥ 4, + ≤ 6, ≤ 2,
, ≥ 0.

3. A company wants to produce three products: A, B and C. The per unit profit on these
products is INR 4, INR 6 and INR 2, respectively. These products requires two types of
resources, manpower and raw material. The LP model formulate for determining the
optimal product mix is as follows:
=4 + 6 + 2
ℎ
+ + ≤ 3, + 4 + 7 ≤ 9,
, , ≥ 0.
where , , = number of units of products A, B, and C, respectively, to be produced.
a. Find the optimal product mix and the corresponding profit of the company.
b. Which constraint should be given the priority to increase z?
c. Find the range of right hand side of the preferred constraint found in (b) such that
the dual price of the preferred constraint remains same. Assume no change in the
other constraint.
d. Find the range of the profit contribution of product C in the objective function,
such that the current optimal product mix remains unchanged.
e. Find the range of the profit contribution of product A in the objective function
such that the current optimal product mix remains unchanged.

You might also like