In a convex set of solutions to a linear-programming problem, two extreme points are neighbors if they are connected by an edge of the convex set. The path of solutions determined by the simplex method is one that moves from one neighboring extreme point to another. 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). Neighboring extreme point . 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_661
Download citation
DOI: https://doi.org/10.1007/1-4020-0611-X_661
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