An improved initial basis for the simplex algorithm
From MaRDI portal
Publication:2387247
DOI10.1016/j.cor.2004.01.002zbMath1068.90079OpenAlexW4253692658MaRDI QIDQ2387247
Hélcio Vieira Junior, Marcos Pereira Estellita Lins
Publication date: 2 September 2005
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2004.01.002
Related Items
A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs, A computationally stable solution algorithm for linear programs, A simple direct cosine simplex algorithm, Improvement and its computer implementation of an artificial-free simplex-type algorithm by Arsham, A note on ``An improved initial basis for the simplex algorithm, On the simplex algorithm initializing, Constraint optimal selection techniques (COSTs) for nonnegative linear programming problems, Artificial-free simplex algorithm based on the non-acute constraint relaxation, Scheduling quay cranes and yard trucks for unloading operations in container ports, On simplex method with most-obtuse-angle rule and cosine rule, Hybrid-LP: finding advanced starting points for simplex, and pivoting LP methods, The complex interior-boundary method for linear and nonlinear programming with linear constraints, A triangulation and fill-reducing initialization procedure for the simplex algorithm
Uses Software
Cites Work
- Unnamed Item
- An infeasible (exterior point) simplex algorithm for assignment problems
- An algorithm for simplex tableau reduction: The push-to-pull solution strategy
- An efficient simplex type algorithm for sparse and dense linear programs.
- A new efficient primal dual simplex algorithm
- Two direct methods in linear programming
- An efficient search direction for linear programming problems
