An inequality sorting algorithm for a class of linear programming problems

DOI10.1006/JMAA.1993.1130zbMATH Open0778.90036OpenAlexW2046287848MaRDI QIDQ2367804FDOQ2367804

Authors: V. Lakshmikantham, Syamal K. Sen, Seenith Sivasundaram 

Publication date: 15 August 1993

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jmaa.1993.1130

Recommendations

• Algebraic optimal solution of interval linear programming
• scientific article; zbMATH DE number 2068450
• scientific article; zbMATH DE number 4043607
• Interpretation of inequality constraints involving interval coefficients and a solution to interval linear programming.
• scientific article; zbMATH DE number 4080778

zbMATH Keywords

interval programming

Mathematics Subject Classification ID

Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cited In (3)

• A direct heuristic algorithm for linear programming
• Solving linear programming problems exactly
• \(O(n^ 3)\) noniterative heuristic algorithm for linear programs with error-free implementation.

This page was built for publication: An inequality sorting algorithm for a class of linear programming problems

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