Mathematics · Linear Programming
In a Linear Programming Problem (LPP), the bounded feasible region has corner points A(15, 10), B(15, 0), C(0, 30), and D(30, 5). If the minimum value of the objective function Z = ax + by (a, b > 0) occurs at both points B and C, then:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 12a = b✓
- 2a = 2b
- 32a = 3b
- 43a = 2b
Correct answer
2a = b
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