Minimise and Maximise Z = x + 2y subject to x + 2y ≥ 100, 2x – y ≤ 0, 2x + y ≤ 200; x, y ≥ 0.

Papers Sign In Request access

Free previous-year papers & practice for JEE, NEET and CBSE Boards.

Papers Privacy Terms Contact

Papers Sign In Request access

Free previous-year papers & practice for JEE, NEET and CBSE Boards.

Papers Privacy Terms Contact

Bounded and Unbounded Feasible Regions | PadhAiPro

Question

TextBounded and Unbounded Feasible Regions

Similar Questions

For the feasible region shown below, the non-trivial constraints of the linear programming problem are

MCQ (Single)Feasible Region in Linear ProgrammingBounded and Unbounded Feasible Regions

Solve the following Linear Programming Problem graphically : Maximise Z = 12x + 18y subject to the constraints x + y ≤ 1200 x − 2y ≥ 0 x + 3y ≥ 600 x ≥ 0, y ≥ 0

Text

Mathematical Formulation of Linear Programming Problem

Feasible Region in Linear Programming

Bounded and Unbounded Feasible Regions

Corner Point Method for Linear Programming

Solve the following Linear Programming Problem graphically : Maximize Z = 8x + 8y subject to the constraints x − 20 ≤ 0 2x + 3y ≤ 120 2x + y ≤ 60 x ≥ 0, y ≥ 0

TextMathematical Formulation of Linear Programming ProblemFeasible Region in Linear ProgrammingBounded and Unbounded Feasible RegionsCorner Point Method for Linear Programming

The region represented by the system of inequations 3x + y ≥ 3, 2x − y ≥ −5, x, y ≥ 0 is :

MCQ (Single)Feasible Region in Linear ProgrammingBounded and Unbounded Feasible Regions

Determine graphically the minimum value of the objective function Z = – 50x + 20y subject to the constraints: 2x – y ≥ – 5, 3x + y ≥ 3, 2x – 3y ≤ 12, x ≥ 0, y ≥ 0.

TextBounded and Unbounded Feasible Regions

Minimise and Maximise Z = 5x + 10 y subject to x + 2y ≤ 120, x + y ≥ 60, x – 2y ≥ 0, x, y ≥ 0.

TextBounded and Unbounded Feasible Regions