Mathematics · Linear Programming
In a Linear Programming Problem (LPP), a basic feasible solution remains optimal as long as:
- 1all Cj > 0.
- 2the value of the objective function does not change.
- 3all Cj - Zj values remain zero.
- 4the coefficients of the objective function do not change beyond the optimality range.✓
Correct answer
the coefficients of the objective function do not change beyond the optimality range.
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