Define a corner point of a feasible region.

Maximum value of the objective function Z = ax +by in a LPP always occurs at only one corner point of the feasible region.

In a LPP, the maximum value of the objective function Z = ax +by is always 0, if origin is one of the corner point of the feasible region.

Consider the following statements I. If the feasible region of an LPP is undbounded then maximum or minimum value of the obJective function Z = ax + by may or may not exist . II. Maximum value of the objective function Z = ax + by in an LPP always occurs at only one corner point of the feasible region. Ill. In an LPP, the minimum value of the objective function Z = ax + by is always 0, if origin is one of the corner point of the feasible region. IV. In an LPP, the maximum value of the objective function Z = ax + by is always finite. Which of the following statements are true?

The optimal value of the objective function is attained at the points A)given by intersection of inequations with axes only B) given by intersection of inequations with X-axis only C) given by corner points of the feasible region D) none of teh above

The optimal value of the objective function is attained at the points A)Given by intersection of inequations with the axes only B)Given by intersection of inequations with the axes only C)Given by corner points of the feasible region D)None of these

Which of the following is a corner point of the feasible region of system of linear inequations 2x + 3y lt=6 , x + 4y lt= 4 and x, y gt= 0 ?

If the corner points of a feasible region of system of linear inequalities are (15,20) (40,15) and (2,72) and the objective function is Z = 6x + 3y then Z_(max) - Z_(min) =

One of the corner points of the feasible region of inequalities gives

Find the corner points of the feasible region of the linear programming problem;,Max Z=x : Subject to the constraints 3x+2y =0,y>=0