Linear Programming

Feasible region in the set of points which satisfy

A set of values of decision variables which satisfies the linear constraints and nn-negativity conditions of a L.P.P. is called its

The maximum value of the object function Z = 5x + 10 y subject to the constraints x + 2y ≤ 120, x + y ≥ 60, x – 2y ≥ 0, x ≥ 0, y ≥ 0 is

Objective function of a linear programming problem is

The corner points of the feasible region determined by the following system of linear inequalities: 2x + y ≤ 10, x + 3y ≤ 15, x, y ≥ 0 are (0, 0), (5, 0), (3, 4) and (0, 5). Let Z = px + qy, where p, q > 0. Conditions on p and q so that the maximum of Z occurs at both (3, 4) and (0, 5) is

The corner points of the feasible region determined by the system of linear constraints are (0, 10), (5, 5), (15, 15), (0, 20). Let Z = px + qy, where p, q> 0. Condition on p and q so that the maximum of Z occurs at both the points (15, 15) and (0, 20) is Maximum of Z occurs at:

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

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