Pivot selection methods of the Devex LP code
From MaRDI portal
Publication:5677274
DOI10.1007/BF01580108zbMath0261.90031MaRDI QIDQ5677274
Publication date: 1973
Published in: Mathematical Programming (Search for Journal in Brave)
Related Items
Numerical aspects in developing LP softwares, LPAKO and LPABO, A new local dimming algorithm based on the simplex method, A pathsearch damped Newton method for computing general equilibria, Recovering an optimal LP basis from an interior point solution, Primal and dual active-set methods for convex quadratic programming, A linear programming decomposition focusing on the span of the nondegenerate columns, Parallelizing the dual revised simplex method, Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms, Degeneracy in the presence of roundoff errors, On Estimating Optimal Bases for Linear Programs, Computing in Operations Research Using Julia, The simplex method is not always well behaved, Parallel distributed-memory simplex for large-scale stochastic LP problems, Solving linear programs with multiple right-hand sides: Pricing and ordering schemes, Empirical column selection method in the simplex method, Implementing the simplex method as a cutting-plane method, with a view to regularization, A dual projective simplex method for linear programming, CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems, Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method, Experiments with external pivoting, Heuristische Lösungsverfahren Versuch einer Begriffsklärung, Implementation of an interior point method with basis preconditioning, An efficient approach to updating simplex multipliers in the simplex algorithm, qpOASES: a parametric active-set algorithm for~quadratic programming, A projective simplex algorithm using LU decomposition, A largest-distance pivot rule for the simplex algorithm, Efficient nested pricing in the simplex algorithm, Multi-phase dynamic constraint aggregation for set partitioning type problems, A survey of the operational use of ILP models, Towards a practical parallelisation of the simplex method, Computational study of the GDPO dual phase-1 algorithm, Hyper-sparsity in the revised simplex method and how to exploit it, Experiments in mixed-integer linear programming using pseudo-costs, On pricing and backward transformation in linear programming, A bump triangular dynamic factorization algorithm for the simplex method, Primal-dual methods for sustainable harvest scheduling problems, On the Bartels—Golub decomposition for linear programming bases, Improved Primal Simplex: A More General Theoretical Framework and an Extended Experimental Analysis, Testing of a large-scale network optimization program, A degeneracy exploiting LU factorization for the simplex method, A practicable steepest-edge simplex algorithm, Steepest-edge simplex algorithms for linear programming, On a dual method for a specially structured linear programming problem with application to stochastic programming, LPAKO: A Simplex-based Linear Programming Program, A practical anti-cycling procedure for linearly constrained optimization, Vector Space Decomposition for Solving Large-Scale Linear Programs, Vector processing in simplex and interior methods for linear programming, Linear programing formulations and algorithms for radiotherapy treatment planning, A triangulation and fill-reducing initialization procedure for the simplex algorithm, Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation, The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study, Solving staircase linear programs by the simplex method, 2: Pricing, Selected bibliography on degeneracy, Degeneracy graphs: Theory and applications. An updated survey, Advances in design and implementation of optimization software, Pivot rules for linear programming: A survey on recent theoretical developments, Resolving degeneracy in quadratic programming, Encounters with degeneracy: A personal view, A practical anti-degeneracy row selection technique in network linear programming, Solving Large Scale Generalized Networks, MOPS -- Mathematical optimization system, A general phase-I method in linear programming, Adjacent vertex simplex algorithms: More experimental results on random problems
Uses Software
Cites Work
