- 15 Downloads
For a given feasible basis Bv to a linear-programming problem, let the row vector cB be the ordered set of cost coefficients for the vectors in B.v The multiplier vector is defined as π = cBBv−1. If Bv is an optimal basis, then the components of π are the dual variables associated with the corresponding primal constraints. The vector π is also called the simplex multiplier vector, with the components of π being the simplex multipliers. Simplex method.