Artificial-free simplex algorithm based on the non-acute constraint relaxation

DOI10.1016/j.amc.2014.02.040zbMath1401.90266OpenAlexW2087307296MaRDI QIDQ470802

Aua-aree Boonperm, Krung Sinapiromsaran

Publication date: 13 November 2014

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2014.02.040

zbMATH Keywords

linear programmingartificial-freegradient vectornon-acute constraint relaxation

Mathematics Subject Classification ID

Linear programming (90C05) Extreme-point and pivoting methods (90C49)

Related Items

Constraint optimal selection techniques (COSTs) for nonnegative linear programming problems

Uses Software

• MarPlex

Cites Work

• On simplex method with most-obtuse-angle rule and cosine rule
• Practical finite pivoting rules for the simplex method
• A new polynomial-time algorithm for linear programming
• A note on ``An improved initial basis for the simplex algorithm
• An artificial-free simplex-type algorithm for general LP models
• A product-form Cholesky factorization method for handling dense columns in interior point methods for linear programming
• A note on two direct methods in linear programming
• A computationally stable solution algorithm for linear programs
• An improved initial basis for the simplex algorithm
• A simple direct cosine simplex algorithm
• Detecting ``dense columns in interior point methods for linear programs
• The Criss-Cross Method for Solving Linear Programming Problems
• Classroom Note: Initialization of the Simplex Algorithm: An Artificial-Free Approach
• Two direct methods in linear programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item