Mathematics · Linear Programming
Consider the Linear Programming Problem: Maximize Z = 2x1 + 3x2 Subject to: x1 + 3x2 ≤ 123x1 + 2x2 ≤ 12 x1, x2 ≥ 0 Which basic corner-point solutions of the constraint equations fall outside the feasible region (i.e., are infeasible)?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Corner points (x1 = 0, x2 = 6) and (x1 = 12, x2 = 0) are infeasible✓
- 2None of the corner points are infeasible
- 3Corner points (x1 = 12.20, x2 = 6) and (x1 = 0, x2 = 5.24) are infeasible
- 4Corner points (x1 = 10.29, x2 = 2) and (x1 = 0, x2 = 3.34) are infeasible
Correct answer
Corner points (x1 = 0, x2 = 6) and (x1 = 12, x2 = 0) are infeasible
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