Let R be the feasible region for a linear programming problem,and let Z = ax + by be the objective function. If R is bounded, then the objective function Z has both a maximum and a minimum value on R and
Corner points of the feasible region for an LPP are (0, 2), (3, 0), (6, 0), (6, 8) and (0, 5).Let F = 4x + 6y be the objective function. The Minimum value of F occurs at
Maximize Z = 3x + 4y, subject to the constraints: x + y ≤ 1, x ≥ 0, y ≥ 0.