Home
Class 12
MATHS
The linear programming problem : Maximiz...

The linear programming problem : Maximize `z=x_(1)+x_(2)` subject to constraints
`x_(1)+2x_(2)le2000,x_(1)+x_(2)le1500,x_(2)le600,x_(1)ge0` has

A

(a) No feasible solution

B

(b) Unique optimal solution

C

(c) A finite number of optomal solutions

D

(d) Infinite number of optimal solutions

Text Solution

Verified by Experts

The correct Answer is:
D
Promotional Banner

Similar Questions

Explore conceptually related problems

By graphical method, the solutions of linear programming problem maximise Z=3x_(1)+5x_(2) subject to constraints 3x_(1)+2x_(2) le 18, x_(1) le 4, x_(2) le 6, x_(1) ge0,x_(2) ge 0 are

The constraints -x_(1)+x_(2)lt 1, -x_(1)+3x_(2)le9, x_(1), x_(2)gt, 0 defines on

The LPP problem Max z=x_(1)+x_(2) such that -2x_(1)+x_(2)le1,x_(1)le2,x_(1)+x_(2)le3 and x_(1),x_(2)ge0 has

The minimum value of z=2x_(1)+3x_2 subjected to the constraints 2x_(1)+7x_(2)ge22,x_(1)+x_(2)ge6,5x_(1)+x_(2)ge10 and x_(1),x_(2)ge0 , is

The objective function, z=4x_(1)+5x_(2), subject to 2x_(1)+x_(2)ge7,2x_(1)+3x_(2)le15,x_(2)le3,x_(1),x_(2)ge0 has minimum value at the point

For the following linear programming problem minimize Z=4x+6y subject to the constraints 2x+3yge6,x+yle8,yge1,xge0 , the solution is