Mathematics · Linear Programming
Which of the following statement(s) is/are TRUE regarding the Shadow Price (dual variable) in Linear Programming? (A) It represents the marginal value of relaxing a binding constraint by one unit. (B) Shadow prices are zero for non-binding constraints (complementary slackness). (C) Shadow price can be negative in a maximization problem with a 'greater than or equal to' constraint. (D) Shadow prices are always non-negative for standard less-than-or-equal-to constraints in maximization. Choose the correct answer:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1A, B, C and D
- 2B and D only
- 3A, B and C
- 4A and B only✓
Correct answer
A and B only
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