This is an MCQ-based quiz on **Linear Programming.**

This includes Covering problems, Minimum set cover, Minimum vertex cover, and Minimum edge cover.

Feasible region in the set of points which satisfy

Objective function of a linear programming problem is

A constraint

Function to be obtimized

A relation between the variables

None of these

The point which does not lie in the half-plane 2x+3y-12<0 is

(1,2)

(2,1)

(2,3)

(-3,2)

Maximize Z = 3x + 5y, subject to x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9, x ≥ 0, y ≥ 0

Maximize Z = 4x + 6y, subject to 3x + 2y ≤ 12, x + y ≥ 4, x, y ≥ 0

Maximize Z = 7x + 11y, subject to 3x + 5y ≤ 26, 5x + 3y ≤ 30, x ≥ 0, y ≥ 0