AbstractEssential properties of multiobjective programming in real normed linear spaces are studied. Necessary and sufficient conditions for nondominated solutions under regularity and Fréchet differentiability assumptions are developed
We study first- and second-order necessary and sufficient optimality conditions for approximate (wea...
AbstractIn this paper, a generalization of convexity, called d-invexity, is introduced. Substituting...
AbstractIn this note we are interested in the properties of, and methods for locating the set of all...
AbstractEssential properties of multiobjective programming in real normed linear spaces are studied....
AbstractDuality relationships in finding a best approximation from a nonconvex cone in a normed line...
The aim of this paper is to study nondifferentiable constrained multiobjective programs where the pa...
AbstractDuality for multiobjective programming problems having pseudo-convex objective functions and...
This work focuses on scalarization processes for nonconvex set-valued optimization problems whose so...
The multiple objective linear programming (MOLP) problem is to maximize several linear objectives ov...
A convex programming problem in a conic form is a minimization of a linear function $\langle c, x\ra...
In this paper, new necessary conditions for Pareto minimal points to sets and Pareto minimizers for ...
Abstract. In this paper, a generalization of convexity, namely V-r-invexity, is considered in the ca...
This paper gives several characterizations of the solution set of convex programs. No differentiabi...
The multiple objective linear program (MOLP) will be considered as: maximize Cx subject to x (ELEM) ...
summary:We examine new second-order necessary conditions and sufficient conditions which characteriz...
We study first- and second-order necessary and sufficient optimality conditions for approximate (wea...
AbstractIn this paper, a generalization of convexity, called d-invexity, is introduced. Substituting...
AbstractIn this note we are interested in the properties of, and methods for locating the set of all...
AbstractEssential properties of multiobjective programming in real normed linear spaces are studied....
AbstractDuality relationships in finding a best approximation from a nonconvex cone in a normed line...
The aim of this paper is to study nondifferentiable constrained multiobjective programs where the pa...
AbstractDuality for multiobjective programming problems having pseudo-convex objective functions and...
This work focuses on scalarization processes for nonconvex set-valued optimization problems whose so...
The multiple objective linear programming (MOLP) problem is to maximize several linear objectives ov...
A convex programming problem in a conic form is a minimization of a linear function $\langle c, x\ra...
In this paper, new necessary conditions for Pareto minimal points to sets and Pareto minimizers for ...
Abstract. In this paper, a generalization of convexity, namely V-r-invexity, is considered in the ca...
This paper gives several characterizations of the solution set of convex programs. No differentiabi...
The multiple objective linear program (MOLP) will be considered as: maximize Cx subject to x (ELEM) ...
summary:We examine new second-order necessary conditions and sufficient conditions which characteriz...
We study first- and second-order necessary and sufficient optimality conditions for approximate (wea...
AbstractIn this paper, a generalization of convexity, called d-invexity, is introduced. Substituting...
AbstractIn this note we are interested in the properties of, and methods for locating the set of all...
DOI
Add to ORKG