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

DOI10.1007/BF03398681MaRDI QIDQ2467862zbMATH OpenOpenAlexFDO

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

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)

Cites work

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

Cited in

(1)

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

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

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