New criteria for the simplex algorithm

descriptionPublicationkeyboard_double_arrow_right Article 01 Dec 1980 English Publisher:Springer Science and Business Media LLCJournal:Mathematical Programming, volume 19, pages 230-236 (issn: 0025-5610, eissn: 1436-4646,

Copyright policy )

Authors: M. C. Cheng;

doi: 10.1007/bf01581644

New criteria for the simplex algorithm

- Summary
- Subjects
- Metrics

Abstract

The standard linear programming problem with a finite optimum value is considered. We derive new criteria which guarantee that (i) a non-basic variable of a basic feasible solution will remain a non-basic variable of an optimal basic solution; (ii) a basic variable of a basic feasible solution will remain a basic variable of an optimal basic solution.

Related Organizations

University of Malaya
Malaysia

Keywords

finite optimum value, criteria, basic variable, non- degenerate basic feasible solution, non-basic variable, basic feasible solution, basic solution, Numerical mathematical programming methods, Linear programming, simplex algorithm

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	8
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average