Optimality and Degeneracy in Linear Programming
From MaRDI portal
Publication:5817037
DOI10.2307/1907845zbMath0049.37903OpenAlexW2326954772WikidataQ92402643 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
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, Large scale geometric programming: An application in coding theory, A linked list data structure for a simple linear regression algorithm, A simplex-like method with bisection for linear programming1, 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, 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, The positive edge criterion within COIN-OR's CLP, Bounds on the complexity of halfspace intersections when the bounded faces have small dimension, Criss-cross methods: A fresh view on pivot algorithms, Computing pure Nash equilibria in network revenue management games, Revisiting a cutting-plane method for perfect matchings, Intervening duality and bargaining with a farmer-landowner example., A linear programming primer: from Fourier to Karmarkar, Non-archimedean infinitesimals, transcendentals and categorical inputs in linear programming and data envelopment analysis, Revisiting degeneracy, strict feasibility, stability, in linear programming, An algorithm for a least absolute value regression problem with bounds on the parameters, Canonical bases in linear programming, Hauptprobleme der Unternehmensforschung, The use of grossone in mathematical programming and operations research, A geometric consistency theorem for a symbolic perturbation scheme, Ein lineares Programmierungsverfahren, Efficient nested pricing in the simplex algorithm, A new pivoting rule for solving various degeneracy problems, A primal deficient-basis simplex algorithm for linear programming, Stabilized dynamic constraint aggregation for solving set partitioning problems, Multi-phase dynamic constraint aggregation for set partitioning type problems, The extreme point characterization of semi-infinite dual non-Archimedean balls, The pivot and probe algorithm for solving a linear program, Single Commodity Stochastic Network Design Under Probabilistic Constraint with Discrete Random Variables, A primal algorithm for interval linear-programming problems, A new version of the improved primal simplex for degenerate linear programs, A dual method for discrete Chebychev curve fitting, A basis-defiency-allowing variation of the simplex method for linear programming, A linear programming algorithm for curve fitting in the L∞norm, Complexity and computability of solutions to linear programming systems, Modeling the satellite placement problem as a network flow problem with one side constraint, Practical finite pivoting rules for the simplex method, A unified approach to the feasible point method type for nonlinear programming with linear constraints under degeneracy and the convergence properties, Page cuts for integer interval linear programming, Least-index resolution of degeneracy in quadratic programming, Least distance methods for the scheme of polytopes, 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, On the \(\epsilon\)-perturbation method for avoiding degeneracy, Discrete Tchebycheff approximation for multivariate splines, Some NP-complete problems in linear programming, Handling Artificial Variables in a Simplex Method: A Commentary, On the structure of the set bases of a degenerate point, Eine elementare Methode zur Behandlung des Entartungsfalles in der linearen Optimierung, The Reverse Directional Distance Function, Piecewise linear methods for nonlinear equations and optimization, 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, An improved \(N\)-tree algorithm for the enumeration of all neighbors of a degenerate vertex, On some properties of \(0\)-degeneracy graphs, Solving Linear Programming Problems by Reducing to the Form with an Obvious Answer, Shadow prices and sensitivity analysis in linear programming under degeneracy. State-of-the-art-survey
