For any constraint, either its slack/surplus value must be zero or its dual price must be zero.

Name: For any constraint, either its slack/surplus value must be zero or its dual price must be zero.
Brand: Quizplus
Rating: 4.8 (42 reviews)

Question

Quizplus · Accepted Answer

This statement is a reflection of the complementary slackness condition in linear programming, which states that for each constraint, either the slack/surplus is zero or the dual price (shadow price) is zero, but not both.

For Any Constraint, Either Its Slack/surplus Value Must Be Zero