Mathematics · Linear Programming
A basic feasible solution in a linear programming problem geometrically corresponds to a point which:
- 1Lies outside the feasible region
- 2Is an extreme point (corner point) of the feasible region✓
- 3Does not satisfy non-negativity constraints
- 4Lies inside the interior of the feasible region
Correct answer
Is an extreme point (corner point) of the feasible region
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