Mathematics · Linear Programming
The number of feasible solutions for the linear programming problem: Maximize z = 15x + 30y, subject to constraints 3x + y ≤ 12, x + 2y ≤ 10, x ≥ 0, y ≥ 0 is:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Infinite✓
- 24
- 32
- 41
Correct answer
Infinite
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