POLYHEDRA AND OPTIMIZATION RELATED TO A WEAK ABSOLUTE MAJORIZATION ORDERING

DOI10.15807/JORSJ.48.90MaRDI QIDQ5694059zbMATH OpenOpenAlexFDO

Authors Ping Zhan

Publication date 29 September 2005

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/jorsj.48.90

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Multi-objective and goal programming (90C29) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Polyhedra and optimization in connection with a weak majorization ordering
• Weak k-majorization and polyhedra
• scientific article; zbMATH DE number 1182566
• Optimization and approximation for polyhedra in separable Hilbert spaces
• scientific article; zbMATH DE number 702975
• On the order dimension of convex polytopes
• Majorization polytopes
• Polyhedral aspects of discrete optimization
• The Order Dimension of Convex Polytopes

Cited in

(5)

• Weak k-majorization and polyhedra
• A simple construction of complete single-peaked domains by recursive tiling
• Polyhedra and optimization in connection with a weak majorization ordering
• Monotone diameter of bisubmodular polyhedra
• Ordinal efficiency and the polyhedral separating hyperplane theorem

This page was built for publication: POLYHEDRA AND OPTIMIZATION RELATED TO A WEAK ABSOLUTE MAJORIZATION ORDERING

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