Encyclopedia of Operations Research and Management Science

2001 Edition
| Editors: Saul I. Gass, Carl M. Harris

Neighboringextreme point

  • Saul I. Gass
  • Carl M. Harris
Reference work entry
DOI: https://doi.org/10.1007/1-4020-0611-X_661

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.

Copyright information

© Kluwer Academic Publishers 2001

Authors and Affiliations

  • Saul I. Gass
    • 1
  • Carl M. Harris
    • 2
  1. 1.Robert H. Smith School of BusinessUniversity of MarylandCollege PartUSA
  2. 2.School of Information Technology & EngineeringGeorge Mason UniversityFairfaxUSA