Skip to main contentSkip to solution

If the corner points of the bounded feasible region for a Linear Programming Problem (LPP) are A(0,2), B(3, 0), C(2, 3) and D(3, 1), then the maximum value of the objective function Z=4x+2yZ = 4x + 2y occurs at

Solution

Correct Option: 4

The maximum or minimum value of a linear programming problem occurs at the corner points of the feasible region.

The objective function is Z=4x+2yZ = 4x + 2y.

Evaluating at each corner point:

At Point A(0, 2):

Z=4(0)+2(2)Z = 4(0) + 2(2)

Z=0+4Z = 0 + 4

Z=4Z = 4

At Point B(3, 0):

Z=4(3)+2(0)Z = 4(3) + 2(0)

Z=12+0Z = 12 + 0

Z=12Z = 12

At Point C(2, 3):

Z=4(2)+2(3)Z = 4(2) + 2(3)

Z=8+6Z = 8 + 6

Z=14Z = 14

At Point D(3, 1):

Z=4(3)+2(1)Z = 4(3) + 2(1)

Z=12+2Z = 12 + 2

Z=14Z = 14


Both points C(2, 3) and D(3, 1) give the same maximum value of Z=14Z = 14.

When two corner points yield the same maximum value, the objective function is parallel to the edge connecting those points.

This means every point on the line segment joining C(2, 3) and D(3, 1) also gives Z=14Z = 14.


Therefore, the maximum value of Z=14Z = 14 occurs at every point on the line segment joining the points (2, 3) and (3, 1).

Keyboard Shortcuts

  • Left arrow: Previous question
  • Right arrow: Next question
  • S key: Jump to solution
  • Q key: Jump to question