The objective function Z = ax + by of an LPP has maximum value 42 at (4, 6) and minimum value 19 at (3, 2). Which of the following is true?

Objective Function in Linear Programming, Optimal Solution of Linear Programming Problem | PadhAiPro

Question

MCQ (Single)Objective Function in Linear ProgrammingOptimal Solution of Linear Programming ProblemCBSE PYQ

Similar Questions

A linear programming problem deals with the optimization of a/an :

MCQ (Single)Introduction to Linear Programming ProblemsObjective Function in Linear Programming

Solve the following linear programming problem graphically : Maximise z = 500x + 300y, subject to constraints x + 2y ≤ 12 2x + y ≤ 12 4x + 5y ≥ 20 x ≥ 0, y ≥ 0

Text

Optimal Solution of Linear Programming Problem

Corner Point Method for Linear Programming

Assertion (A): The corner points of the bounded feasible region of a L.P.P. are shown below. The maximum value of Z = x + 2y occurs at infinite points. Reason (R): The optimal solution of a LPP having bounded feasible region must occur at corner points.

Assertion-ReasonOptimal Solution of Linear Programming Problem

Determine graphically the minimum value of the following objective function : z = 500x + 400y subject to constraints x + y ≤ 200, x ≥ 20, y ≥ 4x, y ≥ 0.

TextOptimal Solution of Linear Programming ProblemCorner Point Method for Linear Programming

Solve the following linear programming problem graphically : Minimise : z = -3x + 4y subject to the constraints x + 2y ≤ 8, 3x + 2y ≤ 12, x, y ≥ 0.

TextOptimal Solution of Linear Programming ProblemCorner Point Method for Linear Programming

The corner points of the bounded feasible region of an LPP are O(0, 0), A(250, 0), B(200, 50) and C(0, 175). If the maximum value of the objective function Z = 2ax + by occurs at the points A(250, 0) and B(200, 50), then the relation between a and b is :

MCQ (Single)Optimal Solution of Linear Programming ProblemCorner Point Method for Linear Programming