Mathematics · Linear Programming
The feasible region for an LPP has bounded corner points at (0, 0), (16, 0), (8, 12), and (0, 20). If the objective function to be maximized is Z = 22x + 18y, find the optimal point (x, y) that yields the maximum value of Z.
- 1(16, 0)
- 2(8, 12)✓
- 3(0, 20)
- 4(0, 24)
Correct answer
(8, 12)
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!
Preparing for Mathematics?
Practice full-length Mathematics mock tests with real exam timers, instant score analysis, and all-India ranking.
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