SolveIt is under development
SolveItNCERT · CBSE · NEET
Question 38 / 91 · latest first
✓ Board-verified
Mathematics · 2025 · 2 marks

CBSE 2025 · Region 7 · Set 3 · Q24

For a Linear Programming Problem, find min Z =5 x +3 y (where Z is the objective function) for the feasible region shaded in the given figure. (Note:…

For a Linear Programming Problem, find min $\displaystyle \mathrm{Z}=5 \mathrm{x}+3 \mathrm{y}$ (where Z is the objective function) for the feasible region shaded in the given figure. Figure: CBSE Class 12 Mathematics 2025, Linear Programming (Note : The figure is not to scale)
ShareWhatsAppTelegram

More from Linear Programming

CBSE Class 12 Mathematics past-paper question from the 2025 board exam, with the answer as CBSE’s own marking scheme gives it. Where our answers come from.