Mathematics · Linear Programming
The constraints x + 2y ≥ 10, 3x + 4y ≤ 24, x ≥ 0, y ≥ 0 determine a triangular feasible region with vertices:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1(0, 5), (0, 6) and (4, 3)✓
- 2(8, 0), (10, 0) and (4, 3)
- 3(0, 5), (0, 6) and (3, 4)
- 4(0, 0), (0, 6) and (8, 0)
Correct answer
(0, 5), (0, 6) and (4, 3)
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