Linear Programm...

Determine the maximum value of Z = 11x + 7y subject to the constraints :2x + y ≤ 6, x ≤ 2, x ≥ 0, y ≥ 0.

Maximize Z = 3x + 4y, subject to the constraints: x + y ≤ 1, x ≥ 0, y ≥ 0.

Maximise the function Z = 11x + 7y, subject to the constraints: x ≤ 3, y ≤ 2,x ≥ 0, y ≥ 0.

Minimise Z = 13x – 15y subject to the constraints : x + y ≤ 7, 2x – 3y + 6 ≥ 0 , x ≥ 0, y ≥ 0.

Maximize Z = 100x + 120y , subject to constraints 2x + 3y ≤ 30, 3x + y ≤ 17, x ≥ 0, y ≥ 0.

Maximize Z = 5x+3y , subject to constraints x + y ≤ 300 , 2x + y ≤ 360, x ≥ 0, y ≥ 0.

Maximize Z = 50x + 60y , subject to constraints x +2 y ≤ 50 , x +y ≥ 30, x, y ≥ 0.

Minimize Z = 50x+60y , subject to constraints x +2 y ≤ 50 , x + y ≥ 30, x, y ≥ 0.

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