Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Calculus of convex polyhedra and polyhedral convex functions by
  utilizing a multiple objective linear programming solver   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.

33
The categories of this paper are: plasm-ph
27
The categories of this paper are: comp-gas
19
The categories of this paper are: eess
9
The categories of this paper are: nlin
30
The categories of this paper are: q-alg
21
The categories of this paper are: adap-org
35
The categories of this paper are: mtrl-th
28
The categories of this paper are: alg-geom
6
The categories of this paper are: astro-ph
12
The categories of this paper are: nucl-th
20
The categories of this paper are: acc-phys
5
The categories of this paper are: gr-qc
22
The categories of this paper are: chao-dyn
13
The categories of this paper are: quant-ph
23
The categories of this paper are: solv-int
17
The categories of this paper are: q-fin