Algebraic simplex initialization combined with the nonfeasible basis method

DOI10.1016/J.EJOR.2015.03.040zbMATH Open1346.90576OpenAlexW1985180758MaRDI QIDQ319588FDOQ319588

Authors: Hédi Nabli, Sonia Chahdoura 

Publication date: 6 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2015.03.040

Recommendations

• Classroom Note: Initialization of the Simplex Algorithm: An Artificial-Free Approach
• An overview on the simplex algorithm
• A new method of avoiding artificial variables for achieving an initial feasible basis of a linear programming
• An artificial-free simplex-type algorithm for general LP models
• An improved initial basis for the simplex algorithm

zbMATH Keywords

linear programmingformal tableaunonfeasible basis methodsimplex algorithm

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Linear Programming
• An overview on the simplex algorithm
• The many facets of linear programming
• A new efficient primal dual simplex algorithm
• The \(s\)-monotone index selection rules for pivot algorithms of linear programming
• A practicable steepest-edge simplex algorithm
• Title not available (Why is that?)
• Linear Programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Two direct methods in linear programming
• A note on ``An improved initial basis for the simplex algorithm

Cited In (3)

• A triangulation and fill-reducing initialization procedure for the simplex algorithm
• A note on ``An improved initial basis for the simplex algorithm
• Title not available (Why is that?)

Uses Software

• MarPlex

This page was built for publication: Algebraic simplex initialization combined with the nonfeasible basis method

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