Slack and Surplus

In addition to knowing the optimal solution to a linear program, it is helpful to know whether all of the available resources are being used. The term slack is used for the amount of a resource that is not used. For a less-than-or-equal-to constraint,

Slack=(Amount of resource available)(Amount of resource used)

In the Flair Furniture example, there were 240 hours of carpentry time available. If the company decided to produce 20 tables and 25 chairs instead of the optimal solution, the amount of carpentry time used (4T+3C) would be 4(20)+3(25)=155. So

Slack time in carpentry=240155=85

For the optimal solution (3040) to the Flair Furniture problem, the slack is 0, since all 240 hours are used.

The term surplus is used with greater-than-or-equal-to constraints to indicate the amount by which the right-hand side of a constraint is exceeded. For a greater-than-or-equal-to constraint,

Surplus=(Actual amount)(Minimum amount)

Suppose there had been a constraint in the example that required the total number of tables and chairs combined to be at least 42 units (i.e., T+C$42) and the company decided to produce 20 tables and 25 chairs. The total amount produced would be 20+25=45, so the surplus would be

Surplus=4542=3

meaning that 3 units more than the minimum were produced. For the optimal solution (30, 40) in the Flair Furniture problem, if this constraint had been in the problem, the surplus would be 7042=28.

So the slack and surplus represent the difference between the left-hand side (LHS) and the right-hand side (RHS) of a constraint. The term slack is used when referring to less-than-or-equal-to constraints, and the term surplus is used when referring to greater-than-or-equal-to constraints. Most computer software for linear programming will provide the amount of slack or surplus that exists for each constraint in the optimal solution.

A constraint that has zero slack or surplus for the optimal solution is called a binding constraint. A constraint with positive slack or surplus for the optimal solution is called a nonbinding constraint. Some computer outputs will specify whether a constraint is binding or nonbinding.

..................Content has been hidden....................

You can't read the all page of ebook, please click here login for view all page.
Reset