AbstractWe introduce the concept of an ϵ-properly efficient solution and establish the equivalence between ϵ-optimality for a convex multiobjective program and ϵ-optimality for a related parametric (scalar) objective program. Using this equivalence, we establish the necessary and sufficient conditions for an ϵ-properly efficient solution of a nondifferentiable multiobjective objective functions subject to nondifferentiable convex inequality constraints, linear equality constraints, and abstract constraints
summary:We find conditions, in multi-objective convex programming with nonsmooth functions, when the...
summary:We find conditions, in multi-objective convex programming with nonsmooth functions, when the...
AbstractWe present a property that is a characterization of the solution to a scalar optimization pr...
AbstractWe introduce the concept of an ϵ-properly efficient solution and establish the equivalence b...
AbstractNecessary and sufficient conditions without a constraint qualification for ϵ-Pareto optimali...
An upper bound on properly efficient solutions in multiobjective optimization is derived for the cas...
AbstractIn this paper we provide a duality theory for multiobjective optimization problems with conv...
AbstractThe concept of efficiency (Pareto optimum) is used to formulate duality for multiobjective n...
AbstractThe problem of optimizing a real-valued function over the weakly efficient set associated to...
AbstractUsing the scalar ε-parametric approach, we establish the Karush-Kuhn-Tucker (which we call K...
AbstractFor the scalar programming problem, some characterizations for optimal solutions are known. ...
Equitable efficiency in multiple criteria optimization was introduced mathematically in the middle o...
AbstractThe convexity of a subset of a σ-algebra and the convexity of a set function on a convex sub...
AbstractWe consider a multiobjective fractional programming problem (MFP) involving vector-valued ob...
AbstractGreat efforts have been done for studying basic notions like the solvability and stability s...
summary:We find conditions, in multi-objective convex programming with nonsmooth functions, when the...
summary:We find conditions, in multi-objective convex programming with nonsmooth functions, when the...
AbstractWe present a property that is a characterization of the solution to a scalar optimization pr...
AbstractWe introduce the concept of an ϵ-properly efficient solution and establish the equivalence b...
AbstractNecessary and sufficient conditions without a constraint qualification for ϵ-Pareto optimali...
An upper bound on properly efficient solutions in multiobjective optimization is derived for the cas...
AbstractIn this paper we provide a duality theory for multiobjective optimization problems with conv...
AbstractThe concept of efficiency (Pareto optimum) is used to formulate duality for multiobjective n...
AbstractThe problem of optimizing a real-valued function over the weakly efficient set associated to...
AbstractUsing the scalar ε-parametric approach, we establish the Karush-Kuhn-Tucker (which we call K...
AbstractFor the scalar programming problem, some characterizations for optimal solutions are known. ...
Equitable efficiency in multiple criteria optimization was introduced mathematically in the middle o...
AbstractThe convexity of a subset of a σ-algebra and the convexity of a set function on a convex sub...
AbstractWe consider a multiobjective fractional programming problem (MFP) involving vector-valued ob...
AbstractGreat efforts have been done for studying basic notions like the solvability and stability s...
summary:We find conditions, in multi-objective convex programming with nonsmooth functions, when the...
summary:We find conditions, in multi-objective convex programming with nonsmooth functions, when the...
AbstractWe present a property that is a characterization of the solution to a scalar optimization pr...