For a given feasible basis Bv to a linear-programming problem, let the row vector c B be the ordered set of cost coefficients for the vectors in B.v The multiplier vector is defined as π = c B Bv−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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Kluwer Academic Publishers
About this entry
Cite this entry
Gass, S.I., Harris, C.M. (2001). Multiplier vector . In: Gass, S.I., Harris, C.M. (eds) Encyclopedia of Operations Research and Management Science. Springer, New York, NY. https://doi.org/10.1007/1-4020-0611-X_656
Download citation
DOI: https://doi.org/10.1007/1-4020-0611-X_656
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-7923-7827-3
Online ISBN: 978-1-4020-0611-1
eBook Packages: Springer Book Archive