# Reduced cost

In linear programming, it is the sum of the direct cost $LaTeX: (c_j)$ of a nonbasic variable $LaTeX: (j)$ and the indirect costs from induced changes in the levels of the basic variables (to satisfy the equations). For a dual price vector, $LaTeX: p,$ the reduced cost vector is is $LaTeX: c - pA.$