Mathematics · Linear Programming
The constraints -x1 + x2 ≤ 1, -x1 + 3x2 ≤ 9, x1, x2 ≥ 0 define which type of feasible space?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Empty feasible space (no solution)
- 2Both bounded and unbounded feasible space
- 3Unbounded feasible space✓
- 4Bounded feasible space
Correct answer
Unbounded feasible space
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