Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: An Algorithm to Solve Polyhedral Convex Set Optimization Problems   An algorithm which computes a solution of a set optimization problem is
provided. The graph of the objective map is assumed to be given by finitely
many linear inequalities. A solution is understood to be a set of points in the
domain satisfying two conditions: the attainment of the infimum and minimality
with respect to a set relation. In the first phase of the algorithm, a linear
vector optimization problem, called the vectorial relaxation, is solved. The
resulting pre-solution yields the attainment of the infimum but, in general,
not minimality. In the second phase of the algorithm, minimality is established
by solving certain linear programs in combination with vertex enumeration of
some values of the objective map.

34
The categories of this paper are: chem-ph
18
The categories of this paper are: econ
19
The categories of this paper are: eess
23
The categories of this paper are: solv-int
31
The categories of this paper are: ao-sci
14
The categories of this paper are: math-ph
35
The categories of this paper are: mtrl-th
10
The categories of this paper are: q-bio
0
The categories of this paper are: hep-ph
12
The categories of this paper are: nucl-th
4
The categories of this paper are: cond-mat
22
The categories of this paper are: chao-dyn
33
The categories of this paper are: plasm-ph
15
The categories of this paper are: nucl-ex
30
The categories of this paper are: q-alg
11
The categories of this paper are: hep-lat