ExamBro
ExamBro
CUET · MATHS · PYQ PAPER 2025

A linear programming problem is as follows :
Minimize \(z=2 x+3 y\)
Subject to the constraints \(x \geq 3, x \leq 9, y \geq 0, x-y \geq 0, x+y \leq 14\).
The feasible region has 5 corner points including

  1. A (0,0) and (9,5)
  2. B (14,0) and (9,0)
  3. C (7,7) and (3,3)
  4. D (3, 6) and (9,5)
Verified Solution

Answer & Solution

Correct Answer

(C) (7,7) and (3,3)

Step-by-step Solution

Detailed explanation

Corner points of the feasible region: \(x=3, y=0 \Rightarrow (3,0)\) \(x=3, y=x \Rightarrow (3,3)\) \(x=9, y=0 \Rightarrow (9,0)\) \(x=9, x+y=14 \Rightarrow 9+y=14 \Rightarrow y=5 \Rightarrow (9,5)\)…
Same subject
Explore more questions on app
From CUET
Explore more questions on app