Question

(Ans. X1
=
3x2
=
Limax
960
27. Consider the following L.P.P. graphically:
Maximize
Z = 50x7 + 60x2,
subject to
2x2 + 3x2 = 1,500,
3x, + 2x2 5 1,500,
X1 S 400,
X2 S 400,
2x = 3x2
*1,*2 2 0.
(1) Construct the constraint lines on the graph.
(ii) Mark the feasible region area.
(iii) Graph at least two isoprofit lines and mark direction of improvement of Z.
(iv) Obtain the optimal solution for the problem.
[Karn. U.B.E. (Mech.) 19.
(Ans. (iv) x, = 300, x2 = 300; Zmax = 33,00​

Answer 1

first right fully sentence

Answer 2

Answer:

Two basic solution approaches of linear

programming exist

The graphical Method

simple, but limited to two decision variables

The simplex method

more complex, but solves multiple decision

variable problems