Calculus of convex polyhedra and polyhedral convex functions by utilizing a multiple objective linear programming solver. (3rd October 2019)

• Record Type: Journal Article
• Authors: Ciripoi, Daniel; Löhne, Andreas; Weißing, Benjamin
• Is Part Of: Optimization. Volume 68:Number 10(2019)
• Page Start: 2039
• Page End: 2054
• Publication Date: 2019-10-03
• Subjects: Polyhedron -- polyhedral set -- polyhedral convex analysis -- polyhedron computations -- multiple objective linear programming; 52B55 -- 90C29; Mathematical optimization -- Periodicals; 519.7
• DOI: 10.1080/02331934.2018.1518447
• Languages: English
• ISSNs: 0233-1934

Abstract

ABSTRACT: The article deals with operations defined on convex polyhedra or polyhedral convex functions. Given two convex polyhedra, operations like Minkowski sum, intersection and closed convex hull of the union are considered. Basic operations for one convex polyhedron are, for example, the polar, the conical hull and the image under affine transformation. The concept of a P-representation of a convex polyhedron is introduced. It is shown that many polyhedral calculus operations can be expressed explicitly in terms of P-representations. We point out that all the relevant computational effort for polyhedral calculus consists in computing projections of convex polyhedra. In order to compute projections we use a recent result saying that multiple objective linear programming (MOLP) is equivalent to the polyhedral projection problem. Based on the MOLP solver bensolve a polyhedral calculus toolbox for Matlab and GNU Octave is developed. Some numerical experiments are discussed.