Chapter 7 – Slack and Surplus Variables

This flashcard set covers key vocabulary and concepts related to Slack and Surplus Variables in linear programming.

Slack Variables

Variables added to inequalities to convert them into equalities in linear programming.

Surplus Variables

Variables subtracted from inequalities to convert them into equalities in linear programming.

Standard Form

A linear program where all constraints are equalities and non-negative variables.

Feasible Region

The set of all possible points that satisfy all constraints in a linear programming problem.

Objective Function

A mathematical expression that defines the quantity to be maximized or minimized in a linear programming model.

Optimal Solution

The best solution that either maximizes or minimizes the objective function within the feasible region.

Linear Programming (LP) Problem

A mathematical method for determining a way to achieve the best outcome in a given mathematical model.

Extreme Points

Vertices of the feasible region that may contain the optimal solution of a linear programming problem.

Binding Constraint

A constraint that holds as an equality at the optimal solution.

Non-Binding Constraint

A constraint that does not hold as an equality at the optimal solution, indicating slack or surplus.