Encyclopedia of Operations Research and Management Science

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

Dual-simplex method

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

An algorithm which solves a linear-programming problem by solving its dual problem. The algorithm starts with a dual feasible but primal infeasible solution, and iteratively attempts to improve the dual objective function while maintaining dual feasibility.

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