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

DOI10.1016/J.AMC.2014.02.040zbMATH Open1401.90266OpenAlexW2087307296MaRDI QIDQ470802FDOQ470802

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

Recommendations

• scientific article; zbMATH DE number 1546510
• Classroom Note: Initialization of the Simplex Algorithm: An Artificial-Free Approach
• New variant of artificial-free algorithm for linear programming
• Deficiency-basis relaxation algorithm based on the most obtuse angle principle
• A Revised Dual Projective Pivot Algorithm for Linear Programming

zbMATH Keywords

linear programmingartificial-freegradient vectornon-acute constraint relaxation

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A new polynomial-time algorithm for linear programming
• An improved initial basis for the simplex algorithm
• Linear programming and its application.
• Title not available (Why is that?)
• Two direct methods in linear programming
• A note on ``An improved initial basis for the simplex algorithm
• A computationally stable solution algorithm for linear programs
• Title not available (Why is that?)
• Detecting ``dense columns in interior point methods for linear programs
• 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 simple direct cosine simplex algorithm
• The Criss-Cross Method for Solving Linear Programming Problems
• Classroom Note: Initialization of the Simplex Algorithm: An Artificial-Free Approach
• On simplex method with most-obtuse-angle rule and cosine rule
• Practical finite pivoting rules for the simplex method

Cited In (1)

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

Uses Software

• MarPlex

This page was built for publication: Artificial-free simplex algorithm based on the non-acute constraint relaxation

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