A variation of the simplex method and parametric programming in which the given linear-programming problem is adjusted so that the same parameter is added to each cost coefficient and each right-hand-side element. By using a sequence of primal and dual simplex transformations, the problem will be optimal for some value of the parameter, with the process continuing until a solution with a zero value of the parameter is found. Simplex method.
This is a preview of subscription content, log in via an institution to check access.
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). Self-dual parametric algorithm. 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_931
Download citation
DOI: https://doi.org/10.1007/1-4020-0611-X_931
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