Mathematics · Linear Programming
If a non-redundant constraint is removed from a Linear Programming (LP) problem, then the:
- 1feasible region will remain same
- 2solution will become infeasible
- 3feasible region will become smaller
- 4feasible region will become larger✓
Correct answer
feasible region will become larger
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!
Preparing for Mathematics?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
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