Mathematics · Linear Programming and Optimization
To solve the following Linear Programming Problem (LPP) by the Big-M simplex method, how many artificial variables need to be added? Minimize Z = 5x1 + 2x2 subject to: 3x1 + x2 = 4 x1 + 2x2 ≤ 32x1 + x2 ≥ 3 and x1, x2 ≥ 0
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 11
- 22✓
- 33
- 44
Correct answer
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!
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 and Optimization MCQs →Want more practice questions on Linear Programming and Optimization?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Mathematics · Linear Programming and Optimization