Implementing the Simplex Method: The Initial Basis

DOI10.1287/IJOC.4.3.267MaRDI QIDQ4030926zbMATH OpenOpenAlexFDO

Authors Robert E. Bixby

Publication date 1 April 1993

Published in ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1911/101696

zbMATH Keywords

bounded-variable simplex method

Mathematics Subject Classification ID

Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)

Recommendations

• On the simplex algorithm initializing
• Computational aspects of linear programming simplex method
• A triangulation and fill-reducing initialization procedure for the simplex algorithm
• Modification and implementation of two-phase simplex method
• An improved initial basis for the simplex algorithm

Cited in

(31)

• Solving symmetric indefinite systems in an interior-point method for linear programming
• Input/state invariant LQ-optimal control: application to competitive coexistence in a chemostat
• LQ-optimal control of positive linear systems
• Gigaflops in linear programming
• A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses
• MILP acceleration: a survey from perspectives of simplex initialization and learning-based branch and bound
• Presolving in linear programming
• Random projections for linear programming: an improved retrieval phase
• A robust and efficient proposal for solving linear systems arising in interior-point methods for linear programming
• Finding an interior point in the optimal face of linear programs
• A two-phase support method for solving linear programs: numerical experiments
• Recovering an optimal LP basis from an interior point solution
• C.A.s.S.a.n.D.r.A: Computerized AnalysiS for Supply ChAiN DistRibution Activity
• Experimental investigations in combining primal dual interior point method and simplex based LP solvers
• Intelligent transportation systems -- Enabling technologies
• A concise way of determination for LP initial feasible basis of simplex method
• Mathematical programming via the least-squares method
• Crash start of interior point methods
• A comprehensive simplex-like algorithm for network optimization and perturbation analysis
• A structure-preserving pivotal method for affine variational inequalities
• A triangulation and fill-reducing initialization procedure for the simplex algorithm
• Solving a class of LP problems with a primal-dual logarithmic barrier method
• A note on ``An improved initial basis for the simplex algorithm
• Pivot rules for linear programming: A survey on recent theoretical developments
• The singly constrained assignment problem: An AP basis algorithm
• Advances in design and implementation of optimization software
• An optimization approach to multiple sequence alignment
• Robust fuzzy stabilization of dithered chaotic systems using island-based random optimization algorithm
• Steepest-edge simplex algorithms for linear programming
• On the simplex algorithm initializing
• Performance evaluation of a family of criss-cross algorithms for linear programming

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: Implementing the Simplex Method: The Initial Basis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4030926)