Artikel
Lizenziert
Nicht lizenziert
Erfordert eine Authentifizierung
A general approach to studying the stability of a Pareto optimal solution of a vector integer linear programming problem
-
V. A. Emelichev
Veröffentlicht/Copyright:
4. Dezember 2007
Abstract
We consider a multicriteria integer linear programming problem with a finite set of admissible solutions. With the use of Minkowski–Mahler inequality, we obtain a bound for the domain in the space of parameters of the problem equipped with some norm where the Pareto optimality of the solution is still retained. In the case of a monotone norm, we give a formula for the stability radius of the solution. As a corollary we obtain the formula for the stability radius in the case of the Hölder norm and, in particular, the Chebyshev norm in the space of parameters of a vector criterion.
Published Online: 2007-12-04
Published in Print: 2007-10-19
© de Gruyter
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Artikel in diesem Heft
- Asymptotic formulas and limit distributions for combinatorial configurations generated by polynomials
- On homomorphisms of many-sorted algebraic systems in connection with cryptographic applications
- A general approach to studying the stability of a Pareto optimal solution of a vector integer linear programming problem
- An upper bound for the number of maximal independent sets in a graph
- On constructing circuits for transforming the polynomial and normal bases of finite fields from one to the other
- One automaton model in biology
- On an automaton model of pursuit
Artikel in diesem Heft
- Asymptotic formulas and limit distributions for combinatorial configurations generated by polynomials
- On homomorphisms of many-sorted algebraic systems in connection with cryptographic applications
- A general approach to studying the stability of a Pareto optimal solution of a vector integer linear programming problem
- An upper bound for the number of maximal independent sets in a graph
- On constructing circuits for transforming the polynomial and normal bases of finite fields from one to the other
- One automaton model in biology
- On an automaton model of pursuit
