0% found this document useful (0 votes)
14 views

Assignment No. 02

Uploaded by

Ayesha Naseer
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
14 views

Assignment No. 02

Uploaded by

Ayesha Naseer
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

National University

Of Computer & Emerging Sciences CFD

Course: MT4031- OR Assignment No.02 Deadline: October 29

CLO#03 Use simplex method to compute the optimal solution of LPP and analyze
its sensitivity.

Question no. 1
Use graphical mehtod
Baba Furniture Company employs four carpenters for 10 days to assemble tables and
chairs. It takes2 person-hours to assemble a table and half a person-hour to assemble a
chair. Customers usually buy one table and four to six chairs. The prices are $135 per
table and $50 per chair. The company operates on 8-hour shift a day.

(a) Determine the10-day optimal production mix.

(b) Compute the shadow prices for the resources and their feasiblility ranges.

(c) If the present unit prices per table and chair are each reduced by10%, use sensitivity
analysis to determine if the optimum solution obtained in (a) will change.

(d) If the present unit prices per table and chair are changed to $120 and $25, respec-
tively, will the solution in (a) change?

Question no. 02
The Gutchi Company manufactures purses, shaving bags, and backpacks. The con-
struction of the three products requires leather and synthetics, with leather being the
limiting raw material. The production process uses two types of skilled labor: sewing
and finishing. The following table gives the availability of the resources, their usage by
the three products, and the prices per unit.

Resource Purse Bag Backpack Daily Availability


2
Leather (ft ) 2 1 3 45
Sewing (hr) 2 1 2 38
Finishing (hr) 2 1 2 80
Price ($) 24 22 35
Formulate the problem as a linear program and find the optimum solution.

For the cases where feasibility is maintained, determine the new optimum solution
(values of the variables and the objective function).

(a) Compute the dual prices and feasibiltity ranges of the resources.

(b) Compute the ranges for the change in the prices of objective function such that the
optimal point does not change.
Next, indicate whether the following changes in the resources will keep the current
solution feasible.

1
(c) Available leather is increased to 51 ft².

(d) Available sewing hours are changed to 46 hrs.

(e) Available finishing hours are decreased by15 hrs.

(f) Would you recommend hiring an additional sewing worker at $15 an hour?

Question no. 03
Consider the following problem.
Maximize Z = 2x1 + 7x2 − 3x3 ,
subject to
x1 + 3x2 + 4x3 ≤ 30,

x1 + 4x2 − x3 ≤ 10,
and
x1 ≥ 0, x2 ≥ 0, x3 ≥ 0.
By letting x4 and x5 be the slack variables for the respective constraints, the simplex
method yields the following final set of equations:

(0) Z + x2 + x3 + 2x5 = 20,


(1) − x2 + 5x3 + x4 − x5 = 20, (1)
(2) x1 + 4x2 − x3 + x5 = 10.
Now you are to conduct sensitivity analysis (post optimality analysis) by indepen-
dently investigating each of the following seven changes in the original model. For each
change, use the sensitivity analysis procedure to revise this set of equations (in tableau
form) and convert it to proper form from Gaussian elimination for identifying and evalu-
ating the current basic solution. Then test this solution for feasibility and for optimality.
If either test fails, reoptimize to find a new optimal solution.
(a) The right-hand side values are
   
b1 20
= .
b2 30

(b) Change the coefficients of x3 to


   
c3 −2
a13  =  3  .
a23 −2

(c) Change the coefficients of x1 to


   
c1 4
a11  = 3 .
a21 2

2
(d) Introduce a new variable x6 with coefficients
   
c6 −3
a16  =  1  .
a26 2

(e) Change the objective function to Z = x1 + 5x2 − 2x3 .


(f) Introduce a new constraint 3x1 + 2x2 + 3x3 ≤ 25.
(g) Change constraint2 to x1 + 2x2 + 2x3 ≤ 35.

You might also like