### Refine

#### Year of publication

#### Keywords

- Intensity modulated radiation therapy (3)
- Mathematikunterricht (3)
- Modellierung (3)
- Standortplanung (3)
- praxisorientiert (3)
- Beam-on time (2)
- Combinatorial Optimization (2)
- Combinatorial optimization (2)
- Decomposition cardinality (2)
- Field splitting (2)
- Multicriteria optimization (2)
- Multileaf collimator sequencing (2)
- Multiobjective programming (2)
- modelling (2)
- praxis orientated (2)
- Approximation Algorithms (1)
- Classification (1)
- Decision Making (1)
- Decomposition of integer matrices (1)
- Discrete decision problems (1)
- Education (1)
- Fuzzy Programming (1)
- Greedy algorithm (1)
- K-best solution (1)
- K-cardinality trees (1)
- Lagrangian Functions (1)
- Level sets (1)
- Lexicographic Order (1)
- Lexicographic max-ordering (1)
- Linear membership function (1)
- Location theory (1)
- Locational Planning (1)
- Matroids (1)
- Max-Ordering (1)
- Multicriteria Optimization (1)
- Multiple Criteria (1)
- Multiple Objective Programs (1)
- NP-completeness (1)
- Optimization (1)
- Pareto Optimality (1)
- Pareto Points (1)
- Pareto optimality (1)
- Saddle Points (1)
- Triangular fuzzy number (1)
- Uniform matroids (1)
- Universal objective function (1)
- Vetor optimization (1)
- cardinality constraint combinatorial optimization (1)
- computational complexity (1)
- consecutive ones property (1)
- convex operator (1)
- decisions (1)
- decrease direction (1)
- directional derivative (1)
- epsilon-constraint method (1)
- intensity map segmentation (1)
- k-cardinality minimum cut (1)
- locational planning (1)
- mathematical education (1)
- multicriteria optimization (1)
- multileaf collimator (1)
- multileaf collimator sequencing (1)
- normal cone (1)
- number of objectives (1)
- properly efficient solution (1)
- radiotherapy (1)
- scalarization (1)
- strictly quasi-convex functions (1)

In this paper we investigate two optimization problems for matroids with multiple objective functions, namely finding the pareto set and the max-ordering problem which conists in finding a basis such that the largest objective value is minimal. We prove that the decision versions of both problems are NP-complete. A solution procedure for the max-ordering problem is presented and a result on the relation of the solution sets of the two problems is given. The main results are a characterization of pareto bases by a basis exchange property and finally a connectivity result for proper pareto solutions.

In this paper we will introduce the concept of lexicographic max-ordering solutions for multicriteria combinatorial optimization problems. Section 1 provides the basic notions of
multicriteria combinatorial optimization and the definition of lexicographic max-ordering solutions. In Section 2 we will show that lexicographic max-ordering solutions are pareto optimal as well as max-ordering optimal solutions. Furthermore lexicographic max-ordering solutions can be used to characterize the set of pareto solutions. Further properties of lexicographic max-ordering solutions are given. Section 3 will be devoted to algorithms. We give a polynomial time algorithm for the two criteria case where one criterion is a sum and one is a bottleneck objective function, provided that the one criterion sum problem is solvable in polynomial time. For bottleneck functions an algorithm for the general case of Q criteria is presented.

In multiple criteria optimization an important research topic is the topological structure of the set \( X_e \) of efficient solutions. Of major interest is the connectedness of \( X_e \), since it would allow the determination of \( X_e \) without considering non-efficient solutions in the
process. We review general results on the subject,including the connectedness result for efficient solutions in multiple criteria linear programming. This result can be used to derive a definition of connectedness for discrete optimization problems. We present a counterexample to a previously stated result in this area, namely that the set of efficient solutions of the shortest path problem is connected. We will also show that connectedness does not hold for another important problem in discrete multiple criteria optimization: the spanning tree problem.

In this paper we consider the problem of decomposing a given integer matrix A into
a positive integer linear combination of consecutive-ones matrices with a bound on the
number of columns per matrix. This problem is of relevance in the realization stage
of intensity modulated radiation therapy (IMRT) using linear accelerators and multileaf
collimators with limited width. Constrained and unconstrained versions of the problem
with the objectives of minimizing beam-on time and decomposition cardinality are considered.
We introduce a new approach which can be used to find the minimum beam-on
time for both constrained and unconstrained versions of the problem. The decomposition
cardinality problem is shown to be NP-hard and an approach is proposed to solve the
lexicographic decomposition problem of minimizing the decomposition cardinality subject
to optimal beam-on time.

It is well known that the greedy algorithm solves matroid base problems for all linear cost functions and is, in fact, correct if and only if the underlying combinatorial structure of the problem is a matroid. Moreover, the algorithm can be applied to problems with sum, bottleneck, algebraic sum or \(k\)-sum objective functions.

Multileaf Collimators (MLC) consist of (currently 20-100) pairs of movable metal leaves which are used to block radiation in Intensity Modulated Radiation Therapy (IMRT). The leaves modulate a uniform source of radiation to achieve given intensity profiles. The modulation process is modeled by the decomposition of a given non-negative integer matrix into a non-negative linear combination of matrices with the (strict) consecutive ones property.