Scribd
Upload
6 views1 page

4. Formulation of LPP, Graphical Method

Uploaded by

asghk97
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
6 views1 page

4. Formulation of LPP, Graphical Method

Uploaded by

asghk97
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
Download as pdf or txt
You are on page 1/ 1

Indian Institute of Technology Patna

CDA, Mathematics II, Spring 2023-24


Tutorial Sheet-4

Formulation of LPP, Graphical Method


distributed by
Dr. Mahendra Kumar Gupta

1. A goldsmith manufactures necklaces and bracelets. The total number of necklaces and bracelets that
he can per day is at most 24. It takes half an hour to make a necklace and an hour to make a bracelets.
It is assumed that he can work for a maximum of 16 hours per day. Further, the prole on a necklace
is 100 and bracelet is 300. Write the problem in the form of LPP. Make graphs of all the constraints
and highlight the feasible region. Solve the problem by graphical method to nd how many of each
should be produced to maximize the prot.
2. Solve by graphical method
max z = 3x1 + 5x2
x1 ≤ 4
x2 ≤ 6
3x1 + 2x2 ≥ 48
x1 ≥ 0, x2 ≥ 0

3. Show graphically that the maximum and minimum values of the objective function for the following
problem are the same.
(Optimize) z = 5x + 3y
x+y ≤6
x≥3
y≥3
2x + 3y ≥ 3
x ≥ 0, y ≥ 0

4. Solve the following LPP by Graphical Method.


min z = x1 − 3x2
2x1 + 3x2 ≤ 4
3x1 + 4x2 ≥ 3
x1 + 2x2 = 5
x2 ≥ 0

5. Solve the problem by Graphical method.


max z = 2x1 − 10x2
x1 − x2 ≥ 0
x1 − 5x2 ≤ −5
x1 ≥ 0, x2 ≥ 0

6. Solve the above problem for minimization.

Answers of selected problems: Q1 optimum point (necklaces = 0, bracelets = 16), optimized maximum
prot = 4800 Q2 No feasible region. No solution Q3 Feasible region contains only one point (x, y) = (3, 3),
z = 24. Q4 Feasible region contains only one point (x1 , x2 ) = (−7, 6), min z = −25 Q5 Feasible region
unbounded. Optimum solution exists. (x1 , x2 ) = (5/4, 5/4), max z = −10, innitely many points of right
hand side of point (5/4, 5/4) on the straight line x1 − 5x2 = −5 Q6 Feasible region unbounded. Optimum
solution is also unbounded.

You might also like