This note develops properties of quasi-efficient solutions and explores interrelationships to the classical concept of efficiency. In particular, a point is a quasi-efficient solution to a multiple objective mathematical program if and only if it is an optimal solution to a scalar maximum problem for some set of nonnegative weights on the objectives. This result is then used to characterize the set of quasi-efficient solutions as the union of efficient solutions to a multiple objective problem over all nonempty subsets of the objectives.efficient solutions, mathematical programming, multiple objectives
We propose and justify the proposition that finding truly global representations of the efficient se...
AbstractWe introduce the concept of an ϵ-properly efficient solution and establish the equivalence b...
AbstractMost of the analysis and algorithms for multiple objective linear programming have focused o...
AbstractThere are various theoretical, algorithmic, and practical reasons for developing necessary a...
An approach to generating all efficient solutions of multiple objective programs with piecewise line...
An upper bound on properly efficient solutions in multiobjective optimization is derived for the cas...
Abstract: The number of efficient points in criteria space of multiple objective combinatorial optim...
In this work we characterize different types of solutions of a vector optimization problem by means ...
We consider multi-objective convex optimal control problems. First we state a relationship between t...
AbstractWe present a property that is a characterization of the solution to a scalar optimization pr...
The main idea of this article is to characterize approximate proper efficiency that is a widely used...
Compromise solutions, as feasible points as close as possible to the ideal (utopia) point, are impor...
The purpose of this paper is to give sufficient conditions of generalized concavity type for a local...
The standard multiple criteria optimization starts with an assumption that the criteria are incompar...
Abstract In this work, several extended approximately invex vector-valued functions of higher order ...
We propose and justify the proposition that finding truly global representations of the efficient se...
AbstractWe introduce the concept of an ϵ-properly efficient solution and establish the equivalence b...
AbstractMost of the analysis and algorithms for multiple objective linear programming have focused o...
AbstractThere are various theoretical, algorithmic, and practical reasons for developing necessary a...
An approach to generating all efficient solutions of multiple objective programs with piecewise line...
An upper bound on properly efficient solutions in multiobjective optimization is derived for the cas...
Abstract: The number of efficient points in criteria space of multiple objective combinatorial optim...
In this work we characterize different types of solutions of a vector optimization problem by means ...
We consider multi-objective convex optimal control problems. First we state a relationship between t...
AbstractWe present a property that is a characterization of the solution to a scalar optimization pr...
The main idea of this article is to characterize approximate proper efficiency that is a widely used...
Compromise solutions, as feasible points as close as possible to the ideal (utopia) point, are impor...
The purpose of this paper is to give sufficient conditions of generalized concavity type for a local...
The standard multiple criteria optimization starts with an assumption that the criteria are incompar...
Abstract In this work, several extended approximately invex vector-valued functions of higher order ...
We propose and justify the proposition that finding truly global representations of the efficient se...
AbstractWe introduce the concept of an ϵ-properly efficient solution and establish the equivalence b...
AbstractMost of the analysis and algorithms for multiple objective linear programming have focused o...