An iteration method of constructing orthogonal projections of convex polyhedral sets

DOI10.1016/0041-5553(85)90170-3MaRDI QIDQ3741455zbMATH OpenOpenAlexWikidataFDO

Authors V. A. Bushenkov

Publication date 1986

Published in USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0041-5553(85)90170-3

zbMATH Keywords

computational experiencesdimensional problem reductionprojection of convex polyhedrasystem of linear inequalitiesupper and lower bounds

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Large-scale problems in mathematical programming (90C06)

Cited in

(4)

• Multiple objective analysis of long-term development strategies for a national economy
• An oracle-based, output-sensitive algorithm for projections of resultant polytopes
• A Simultaneous Iterative Method for Computing Projections on Polyhedra
• Approximating the feasible criterion set in multi-criteria optimization problems described by equations in partial derivatives

This page was built for publication: An iteration method of constructing orthogonal projections of convex polyhedral sets

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