Mathematics · Linear Programming
In a linear programming problem, the corner points of the shaded bounded feasible region are (0, 8), (2, 5), (4, 3), and (9, 0). The minimum value of the objective function Z = 4x + 3y occurs at the point:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1(4, 3)
- 2(9, 0)
- 3(2, 5)✓
- 4(0, 8)
Correct answer
(2, 5)
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Mathematics?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Linear Programming MCQs →Want more practice questions on Linear Programming?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Mathematics · Linear Programming