Mathematics · Linear Programming
A feasible solution in a Linear Programming Problem (LPP): A. Must satisfy all the problem's constraints simultaneously. B. Must be a corner point in the feasible region. C. May or may not optimise the value of the objective function. D. Non-negativity constraints must be satisfied. E. Need not satisfy all constraints, only some of them. Choose the CORRECT statements:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1A and D only
- 2B, C and D only
- 3A, B and D only
- 4A, C and D only✓
Correct answer
A, C and D only
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