Mathematics · Linear Programming Problem & Sensitivity Analysis
In the Linear Programming Problem: Maximize Z = c1x1 + c2x2 Subject to: x1 + 16x2 ≤ 2505x1 + 2x2 ≤ 162 x2 ≤ 50 x1, x2 ≥ 0 If c2 is kept fixed at 45 and the initial value of c1 is 15, determine the range within which c1 can change without changing the optimality of the current basic feasible solution.
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 115 - c2 ≤ c1 ≤ c2
- 215 - 1615 ≤ c1 ≤ 15 + 1615
- 3-15 ≤ c1 ≤ 15
- 415 - 19516 ≤ c1 ≤ 15 + 19516✓
Correct answer
15 - 19516 ≤ c1 ≤ 15 + 19516
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 Problem & Sensitivity Analysis MCQs →Want more practice questions on Linear Programming Problem & Sensitivity Analysis?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Mathematics · Linear Programming Problem & Sensitivity Analysis