Question:medium
Consider the Linear Programming Problem (LPP): Maximize $z = 30x + 60y$ subject to constraints $x + 2y \leq 12$, $2x + y \leq 12$, $4x + 5y \geq 20$, $x \geq 0$, $y \geq 0$. Then the number of corner points of the feasible region is
Consider the Linear Programming Problem (LPP): Maximize $z = 30x + 60y$ subject to constraints $x + 2y \leq 12$, $2x + y \leq 12$, $4x + 5y \geq 20$, $x \geq 0$, $y \geq 0$. Then the number of corner points of the feasible region is
Show Hint
Always consider only feasible intersections (satisfying all inequalities).
Updated On: Apr 24, 2026
- $8$
- $6$
- $3$
- $4$
- $5$
Show Solution
The Correct Option is
Solution and Explanation
Was this answer helpful?
0
Top Questions on Linear Programming Problem
- Maximize \( z = x + y \) subject to: \[ x + y \leq 10, \quad 3y - 2x \leq 15, \quad x \leq 6, \quad x, y \geq 0. \] Find the maximum value.
- MHT CET - 2024
- Mathematics
- Linear Programming Problem
- The feasible region of the linear programming problem is determined by the system of inequalities: \[ x + y \leq 6, \quad x \geq 0, \quad y \geq 0. \] What is the maximum value of \( x + y \) in the feasible region?
- MHT CET - 2025
- Mathematics
- Linear Programming Problem
- The restrictions imposed on decision variables involved in an objective function of a linear programming problem are called:
- CBSE Class XII - 2024
- Mathematics
- Linear Programming Problem
- Solve the following linear programming problem graphically: \[ {Maximise } z = 4x + 3y, \quad {subject to the constraints:} \] \[ x + y \leq 800, \quad 2x + y \leq 1000, \quad x \leq 400, \quad x, y \geq 0. \]
- CBSE Class XII - 2024
- Mathematics
- Linear Programming Problem
- Want to practice more? Try solving extra ecology questions todayView All Questions
