problems based on lpp when feasible region is a


Problems based on LPP when feasible region is a line segment or it does not exist.

1.    Maximize z = 2x+3y subject to the constraints

X + y ≤ 1

X + y ≥ 3

X,  y ≥ 0

script

solution

1.   Let z = 2x+3y

2.   Let us draw lines X +y = 1 and x + y = 3using suitable points on the graph.

3.   There is no common region satisfying the given conditions

X +y = 1 and x + y = 3

Request for Solution File

Ask an Expert for Answer!!
Operation Research: problems based on lpp when feasible region is a
Reference No:- TGS0157280

Expected delivery within 24 Hours