The generalized simplex method for minimizing a linear form under linear inequality restraints

DOI10.2140/pjm.1955.5.183zbMath0064.39402MaRDI QIDQ2653638

George B. Dantzig, Philip Wolfe, Alex Orden

Publication date: 1955

Published in: Pacific Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/pjm.1955.5.183

zbMATH Keywords

mathematical biology, operations research

Related Items

A new pivoting rule for solving various degeneracy problems, The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study, Selected bibliography on degeneracy, Degeneracy graphs: Theory and applications. An updated survey, Combinatoric classes of the transportation problem and their properties, Bounds on the number of vertices of perturbed polyhedra, An effective non-Archimedean anti-degeneracy/cycling linear programming method especially for data envelopment analysis and like models, Encounters with degeneracy: A personal view, An improved \(N\)-tree algorithm for the enumeration of all neighbors of a degenerate vertex, On some properties of \(0\)-degeneracy graphs, A general technique for dealing with degeneracy in reduced gradient methods for linearly constrained nonlinear programming, Standard forms for rational linear arithmetic in constraint logic programming., Criss-cross methods: A fresh view on pivot algorithms, A basis-defiency-allowing variation of the simplex method for linear programming, A unified approach to the feasible point method type for nonlinear programming with linear constraints under degeneracy and the convergence properties, Finding normal solutions in piecewise linear programming, The effectiveness of finite improvement algorithms for finding global optima