Mathematics · Linear Programming
Consider the linear programming problem: Maximize {x 1 + x 2 + x 3 } subject to constraints: x 1 + x 2 - x 3 ≤ 1 x 1 + x 3 ≤ 2 0 ≤ x 1 ≤ 1 2 , x 2 ≥ 0, and 0 ≤ x 3 ≤ 1. Which of the following statements is true?
- 1The optimum value is 3
- 2The optimum value is 3 2✓
- 3(0, 2, 1) is an extreme point of the feasible region
- 4( 1 2 , 0, 1) is the optimal solution
Correct answer
The optimum value is 3 2
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