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