Optimality and Degeneracy in Linear Programming
From MaRDI portal
Publication:5817037
DOI10.2307/1907845zbMath0049.37903WikidataQ92402643 ScholiaQ92402643MaRDI QIDQ5817037
Publication date: 1952
Published in: Econometrica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1907845
Related Items
Handling Artificial Variables in a Simplex Method: A Commentary, The pivot and probe algorithm for solving a linear program, Eine elementare Methode zur Behandlung des Entartungsfalles in der linearen Optimierung, Modeling the satellite placement problem as a network flow problem with one side constraint, Practical finite pivoting rules for the simplex method, Page cuts for integer interval linear programming, On the structure of the set bases of a degenerate point, Canonical bases in linear programming, A geometric consistency theorem for a symbolic perturbation scheme, Efficient nested pricing in the simplex algorithm, Pivoting rules and redundancy schemes in extreme point enumeration, Shadow prices and sensitivity analysis in linear programming under degeneracy. State-of-the-art-survey, A linked list data structure for a simple linear regression algorithm, A Z-simplex algorithm with partial updates, Survey of solved and open problems in the degeneracy phenomenon, A dual approach to primal degeneracy, Degeneracy in the presence of roundoff errors, On the solution of highly degenerate linear programmes, Parametric linear programming and anti-cycling pivoting rules, Intervening duality and bargaining with a farmer-landowner example., An algorithm for a least absolute value regression problem with bounds on the parameters, A new pivoting rule for solving various degeneracy problems, A primal algorithm for interval linear-programming problems, 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, 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, Large scale geometric programming: An application in coding theory, Criss-cross methods: A fresh view on pivot algorithms, Piecewise linear methods for nonlinear equations and optimization, Pivot versus interior point methods: Pros and cons, A phase-1 approach for the generalized simplex algorithm, 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, On the \(\epsilon\)-perturbation method for avoiding degeneracy, Some NP-complete problems in linear programming, A primal deficient-basis simplex algorithm for linear programming, A theorem of convex polyhedra in connection with the problem of finding the set of solutions to a system of linear inequalities, A suboptimization method for interval linear programming: A new method for linear programming, Discrete Tchebycheff approximation for multivariate splines, Hauptprobleme der Unternehmensforschung, Ein lineares Programmierungsverfahren, The extreme point characterization of semi-infinite dual non-Archimedean balls, A dual method for discrete Chebychev curve fitting, A linear programming algorithm for curve fitting in the L∞norm, Complexity and computability of solutions to linear programming systems, Least-index resolution of degeneracy in quadratic programming, A simplex-like method with bisection for linear programming1, Non-archimedean infinitesimals, transcendentals and categorical inputs in linear programming and data envelopment analysis, Least distance methods for the scheme of polytopes
