language-icon Old Web
English
Sign In

Reduced cost

In linear programming, reduced cost, or opportunity cost, is the amount by which an objective function coefficient would have to improve (so increase for maximization problem, decrease for minimization problem) before it would be possible for a corresponding variable to assume a positive value in the optimal solution. It is the cost for increasing a variable by a small amount, i.e., the first derivative from a certain point on the polyhedron that constrains the problem. When the point is a vertex in the polyhedron, the variable with the most extreme cost, negatively for minimization and positively maximization, is sometimes referred to as the steepest edge. In linear programming, reduced cost, or opportunity cost, is the amount by which an objective function coefficient would have to improve (so increase for maximization problem, decrease for minimization problem) before it would be possible for a corresponding variable to assume a positive value in the optimal solution. It is the cost for increasing a variable by a small amount, i.e., the first derivative from a certain point on the polyhedron that constrains the problem. When the point is a vertex in the polyhedron, the variable with the most extreme cost, negatively for minimization and positively maximization, is sometimes referred to as the steepest edge. Given a system minimize c T x {displaystyle mathbf {c} ^{T}mathbf {x} } subject to A x ≤ b , x ≥ 0 {displaystyle mathbf {Ax} leq mathbf {b} ,mathbf {x} geq 0} , the reduced cost vector can be computed as c − A T y {displaystyle mathbf {c} -mathbf {A} ^{T}mathbf {y} } , where y {displaystyle mathbf {y} } is the dual cost vector. It follows directly that for a minimization problem, any non-basic variables at their lower bounds with strictly negative reduced costs are eligible to enter that basis, while any basic variables must have a reduced cost that is exactly 0. For a maximization problem, the non-basic variables at their lower bounds that are eligible for entering the basis have a strictly positive reduced cost.

[ "Mechanical engineering", "Mathematical optimization" ]
Parent Topic
Child Topic
    No Parent Topic