The main idea of this article is to characterize approximate proper efficiency that is a widely used optimality concept in multicriteria optimization problems that prevents solutions having unbounded trade-offs. We analyze a modification of approximate proper efficiency for problems with infinitely many objective functions. We obtain some necessary and sufficient optimality conditions for this modification of approximate proper efficiency. This modified version of approximation guarantees the general characterizations of approximate properly efficient points as solutions to weighted sum problems and modified weighted Tchebycheff norm problems, even if there is an infinite number of criteria. The provided proofs concerning the modified defin...
International audienceCombinatorial optimization problems serve as models for a great number of real...
We consider a vector generic combinatorial optimization problem in which initial coefficients of obj...
In this paper, we show that for a large class of optimization prob-lems, the Lagrange multiplier rul...
The concept and characterization of proper efficiency is of significant theoretical and computationa...
In this paper, we introduce a new kind of properly approximate efficient solution of vector optimiza...
In this work, necessary and sufficient conditions for approximate solutions of vector optimization p...
An upper bound on properly efficient solutions in multiobjective optimization is derived for the cas...
Properties and construction principles of a satisfactory approximation for the set of admissible sol...
This note develops properties of quasi-efficient solutions and explores interrelationships to the cl...
AbstractUsing the theory of abstract optimization problems in infinite-dimensional spaces we provide...
In this paper we study epsilon-proper efficiency in multiobjective optimization. We introduce variou...
Using the theory of abstract optimization problems in infinite-dimensional spaces we provide necessa...
In this note we discuss some drawbacks of some approaches to the classification of NP-complete optim...
Abstract. In this work we characterize different types of solutions of a vector optimization problem...
In computability and in complexity theory reductions are widely used for mapping sets into sets in o...
International audienceCombinatorial optimization problems serve as models for a great number of real...
We consider a vector generic combinatorial optimization problem in which initial coefficients of obj...
In this paper, we show that for a large class of optimization prob-lems, the Lagrange multiplier rul...
The concept and characterization of proper efficiency is of significant theoretical and computationa...
In this paper, we introduce a new kind of properly approximate efficient solution of vector optimiza...
In this work, necessary and sufficient conditions for approximate solutions of vector optimization p...
An upper bound on properly efficient solutions in multiobjective optimization is derived for the cas...
Properties and construction principles of a satisfactory approximation for the set of admissible sol...
This note develops properties of quasi-efficient solutions and explores interrelationships to the cl...
AbstractUsing the theory of abstract optimization problems in infinite-dimensional spaces we provide...
In this paper we study epsilon-proper efficiency in multiobjective optimization. We introduce variou...
Using the theory of abstract optimization problems in infinite-dimensional spaces we provide necessa...
In this note we discuss some drawbacks of some approaches to the classification of NP-complete optim...
Abstract. In this work we characterize different types of solutions of a vector optimization problem...
In computability and in complexity theory reductions are widely used for mapping sets into sets in o...
International audienceCombinatorial optimization problems serve as models for a great number of real...
We consider a vector generic combinatorial optimization problem in which initial coefficients of obj...
In this paper, we show that for a large class of optimization prob-lems, the Lagrange multiplier rul...