The generalized simplex method for minimizing a linear form under linear inequality restraints
From MaRDI portal
Publication:2653638
DOI10.2140/PJM.1955.5.183zbMath0064.39402OpenAlexW1971258090MaRDI QIDQ2653638
Alex Orden, George B. Dantzig, Philip Wolfe
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
Related Items (68)
A phase-1 approach for the generalized simplex algorithm ⋮ A general technique for dealing with degeneracy in reduced gradient methods for linearly constrained nonlinear programming ⋮ Inverse correspondence analysis ⋮ Sparse data-driven quadrature rules via \(\ell^p\)-quasi-norm minimization ⋮ Learning lexicographic orders ⋮ Primal and dual active-set methods for convex quadratic programming ⋮ A Z-simplex algorithm with partial updates ⋮ A linear programming decomposition focusing on the span of the nondegenerate columns ⋮ Standard forms for rational linear arithmetic in constraint logic programming. ⋮ Survey of solved and open problems in the degeneracy phenomenon ⋮ Finding normal solutions in piecewise linear programming ⋮ Degeneracy in the presence of roundoff errors ⋮ On the solution of highly degenerate linear programmes ⋮ The positive edge pricing rule for the dual simplex ⋮ Criss-cross methods: A fresh view on pivot algorithms ⋮ Approximations of One-dimensional Expected Utility Integral of Alternatives Described with Linearly-Interpolated p-Boxes ⋮ Unnamed Item ⋮ Optimal role and position assignment in multi-robot freely reachable formations ⋮ A linear programming primer: from Fourier to Karmarkar ⋮ Mathematical programming via the least-squares method ⋮ A multiparametric strategy for the two step optimization of structural assemblies ⋮ A divide-and-conquer algorithm for binary matrix completion ⋮ Revisiting degeneracy, strict feasibility, stability, in linear programming ⋮ Lineare Programme ⋮ Proximate linear programming: A variable extreme point method ⋮ The use of grossone in mathematical programming and operations research ⋮ Democratic approximation of lexicographic preference models ⋮ On stochastic linear inequalities ⋮ Ein lineares Programmierungsverfahren ⋮ Nonnegative control of finite-dimensional linear systems ⋮ Lexicographic perturbation for multiparametric linear programming with applications to control ⋮ Efficient nested pricing in the simplex algorithm ⋮ Uses and computation of imprecise probabilities from statistical data and expert arguments ⋮ Modelling the cracks produced by settlements in masonry structures ⋮ A new pivoting rule for solving various degeneracy problems ⋮ No unitary bootstrap for the fractal Ising model ⋮ A primal deficient-basis simplex algorithm for linear programming ⋮ Multi-phase dynamic constraint aggregation for set partitioning type problems ⋮ Linear time-dependent constraints programming with MSVL ⋮ The pivot and probe algorithm for solving a linear program ⋮ Sulla soluzione dell'equazione biarmonica con metodi di programmazione lineare ⋮ A formalization of convex polyhedra based on the simplex method ⋮ Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra ⋮ Multiparametric linear programming with applications to control ⋮ Improved Primal Simplex: A More General Theoretical Framework and an Extended Experimental Analysis ⋮ Linearization of McCormick relaxations and hybridization with the auxiliary variable method ⋮ A basis-defiency-allowing variation of the simplex method for linear programming ⋮ A practical anti-cycling procedure for linearly constrained optimization ⋮ Modeling the satellite placement problem as a network flow problem with one side constraint ⋮ A unified approach to the feasible point method type for nonlinear programming with linear constraints under degeneracy and the convergence properties ⋮ Least-index resolution of degeneracy in quadratic programming ⋮ The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study ⋮ An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment ⋮ The effectiveness of finite improvement algorithms for finding global optima ⋮ Eine elementare Methode zur Behandlung des Entartungsfalles in der linearen Optimierung ⋮ George B. Dantzig: a legendary life in mathematical programming ⋮ Pivoting rules and redundancy schemes in extreme point enumeration ⋮ Pivot versus interior point methods: Pros and cons ⋮ 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 ⋮ Farkas' Lemma, other theorems of the alternative, and linear programming in infinite-dimensional spaces: a purely linear-algebraic approach ⋮ Shadow prices and sensitivity analysis in linear programming under degeneracy. State-of-the-art-survey
This page was built for publication: The generalized simplex method for minimizing a linear form under linear inequality restraints
