Analysis of hybrid heuristic model reduction algorithms for solving linear programming problems.

DOI10.1007/BF03398681zbMath1278.90250OpenAlexW2778101084MaRDI QIDQ2467862

P. Narayanasamy, T. R. Natesan, V. C. Jacob, V. Rhymend Uthariaraj

Publication date: 29 January 2008

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03398681

Mathematics Subject Classification ID

Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (1)

An approach to find redundant objective function(s) and redundant constraint(s) in multi-objective nonlinear stochastic fractional programming problems

Cites Work

• Redundancy in mathematical programming. A state-of-the-art survey
• A heuristic approach for identification of redundant constraints in linear programming models

This page was built for publication: Analysis of hybrid heuristic model reduction algorithms for solving linear programming problems.