Modified simplex splitting algorithm for finding feasible solution of systems of linear inequalities

DOI10.5539/JMR.V4N1P116MaRDI QIDQ4918463zbMATH OpenOpenAlexFDO

Authors E. O. Effanga, Z. Lipcsey, M. E. Nja

Publication date 25 April 2013

Published in Journal of Mathematics Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL http://ccsenet.org/journal/index.php/jmr/article/view/14694/10057

zbMATH Keywords

feasible solutiongeneralized relaxation methodinfeasible solutionpolynomially bounded algorithmsimplex splitting algorithm

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• scientific article; zbMATH DE number 1131736
• A primal-dual projection method for solving systems of linear inequalities
• scientific article; zbMATH DE number 1372525
• scientific article; zbMATH DE number 3844949
• Modification and implementation of two-phase simplex method

Cited in

(2)

• A modified version of the Theil-van de Panne algorithm for systems of linear inequalities
• scientific article; zbMATH DE number 910295 (Why is no real title available?)

This page was built for publication: Modified simplex splitting algorithm for finding feasible solution of systems of linear inequalities

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