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

DOI10.1137/S0036144596304722MaRDI QIDQ4376475zbMATH OpenOpenAlexFDO

Authors H. 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)

Recommendations

• An artificial-free simplex-type algorithm for general LP models
• A new method of avoiding artificial variables for achieving an initial feasible basis of a linear programming
• Publication:3468880
• Algebraic simplex initialization combined with the nonfeasible basis method

Cited in

(19)

• Linearly constrained global optimization: a general solution algorithm with applications.
• An algorithm for simplex tableau reduction: The push-to-pull solution strategy
• A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs
• A computer implementation of the push-and-pull algorithm and its computational comparison with LP simplex method
• scientific article; zbMATH DE number 2185550 (Why is no real title available?)
• Algebraic simplex initialization combined with the nonfeasible basis method
• A triangulation and fill-reducing initialization procedure for the simplex algorithm
• Artificial-free simplex algorithm based on the non-acute constraint relaxation
• A note on ``An improved initial basis for the simplex algorithm
• scientific article; zbMATH DE number 4135711 (Why is no real title available?)
• Improvement and its computer implementation of an artificial-free simplex-type algorithm by Arsham
• A two-phase method without any artificial variable
• Ein beliebig startender Simplex-Algorithmus
• A new method of avoiding artificial variables for achieving an initial feasible basis of a linear programming
• New variant of artificial-free algorithm for linear programming
• A validation and verification tool for global optimization solvers
• Interior-point methods for linear programming: a review
• Performance evaluation of a family of criss-cross algorithms for linear programming
• A computationally stable solution algorithm for linear programs

Describes a project that uses

Uses Software

• MarPlex

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

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