On the simplex algorithm initializing
From MaRDI portal
Publication:1938217
DOI10.1155/2012/487870zbMath1256.90025OpenAlexW2059146830WikidataQ58695314 ScholiaQ58695314MaRDI QIDQ1938217
Nebojša V. Stojković, Marko D. Petković, Predrag S. Stanimirović, Danka S. Milojković
Publication date: 4 February 2013
Published in: Abstract and Applied Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2012/487870
Linear programming (90C05) Numerical methods for variational inequalities and related problems (65K15)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on ``An improved initial basis for the simplex algorithm
- An overview on the simplex algorithm
- The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study
- Stabilization of Mehrotra's primal-dual algorithm and its implementation
- An improved initial basis for the simplex algorithm
- A simple direct cosine simplex algorithm
- New Finite Pivoting Rules for the Simplex Method
- Modification and implementation of two-phase simplex method
- Two direct methods in linear programming
- Linear programming. Foundations and extensions
- Benchmarking optimization software with performance profiles.