Mathematics · Linear Programming
A bounded feasible region has vertices at points like (0, 2), (0, 4), (2, 3), and (1, 0). Excluding the non-negativity constraints (x, y ≥ 0), the linear constraints defining this shaded region are:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 12x + y ≥ 2, x - y ≥ 1, x + 2y ≥ 8
- 22x + y ≥ 2, x - y ≥ 1, x + 2y ≤ 8
- 32x + y ≥ 2, x - y ≤ 1, x + 2y ≤ 8✓
- 42x + y ≤ 2, x - y ≤ 1, x + 2y ≤ 8
Correct answer
2x + y ≥ 2, x - y ≤ 1, x + 2y ≤ 8
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