Classroom Note: Initialization of the Simplex Algorithm: An Artificial-Free Approach

DOI10.1137/S0036144596304722zbMath0891.90125OpenAlexW2041349426MaRDI QIDQ4376475

Hossein Arsham

Publication date: 10 February 1998

Published in: SIAM Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0036144596304722

zbMATH Keywords

linear programmingartificial variablebasic variable setadvanced basis

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (10)

A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs ⋮ A computationally stable solution algorithm for linear programs ⋮ Performance evaluation of a family of criss-cross algorithms for linear programming ⋮ Improvement and its computer implementation of an artificial-free simplex-type algorithm by Arsham ⋮ An algorithm for simplex tableau reduction: The push-to-pull solution strategy ⋮ Artificial-free simplex algorithm based on the non-acute constraint relaxation ⋮ A validation and verification tool for global optimization solvers ⋮ A computer implementation of the push-and-pull algorithm and its computational comparison with LP simplex method ⋮ Linearly constrained global optimization: a general solution algorithm with applications. ⋮ Interior-point methods for linear programming: a review

Uses Software

• MarPlex

This page was built for publication: Classroom Note: Initialization of the Simplex Algorithm: An Artificial-Free Approach