Add to ORKGThe purpose of this paper is to give sufficient conditions of generalized concavity and convexity type for a local (weakly) max-min efficient solution to be a global (weakly) max-min efficient solution for an vector maxmin programming problem. In the particular case of the vector max-min pseudomonotonic programming problem{}, we derive some characterizations properties of max-min efficient and properly max-min efficient solutions
One of the aim of this paper is to introduce new classes of vector generalized concave functions and...
The purpose of this paper is to characterize the weak efficient solutions, the efficient solutions, ...
The efficient set of a linear multicriteria programming problem can be representedby a reverse conve...
The purpose of this paper is to give sufficient conditions of generalized concavity type for a local...
It is well-known that all local minimum points of a semistrictly quasiconvex real-valued function ar...
The main goal of this paper is to prove some new results and extend some earlier ones about functio...
Many fundamental machine learning tasks can be formulated as min-max optimization. This motivates us...
Any local maximizer of an explicitly quasiconvex real-valued function is actually a global minimizer...
In this work, we introduce the notion of preinvex function for functions between Banach spaces. By u...
AbstractThe problem of optimizing a real-valued function over the weakly efficient set associated to...
2000 Mathematics Subject Classification: Primary 90C29; Secondary 49K30.In this paper, we establish ...
Abstract. In this work we characterize different types of solutions of a vector optimization problem...
One of the classes of the methods for solution of the non-linear programming (NLP) problem named the...
AbstractThe concept of efficiency (Pareto optimum) is used to formulate duality for multiobjective n...
summary:Two conditions are given each of which is both necessary and sufficient for a point to be a ...
One of the aim of this paper is to introduce new classes of vector generalized concave functions and...
The purpose of this paper is to characterize the weak efficient solutions, the efficient solutions, ...
The efficient set of a linear multicriteria programming problem can be representedby a reverse conve...
The purpose of this paper is to give sufficient conditions of generalized concavity type for a local...
It is well-known that all local minimum points of a semistrictly quasiconvex real-valued function ar...
The main goal of this paper is to prove some new results and extend some earlier ones about functio...
Many fundamental machine learning tasks can be formulated as min-max optimization. This motivates us...
Any local maximizer of an explicitly quasiconvex real-valued function is actually a global minimizer...
In this work, we introduce the notion of preinvex function for functions between Banach spaces. By u...
AbstractThe problem of optimizing a real-valued function over the weakly efficient set associated to...
2000 Mathematics Subject Classification: Primary 90C29; Secondary 49K30.In this paper, we establish ...
Abstract. In this work we characterize different types of solutions of a vector optimization problem...
One of the classes of the methods for solution of the non-linear programming (NLP) problem named the...
AbstractThe concept of efficiency (Pareto optimum) is used to formulate duality for multiobjective n...
summary:Two conditions are given each of which is both necessary and sufficient for a point to be a ...
One of the aim of this paper is to introduce new classes of vector generalized concave functions and...
The purpose of this paper is to characterize the weak efficient solutions, the efficient solutions, ...
The efficient set of a linear multicriteria programming problem can be representedby a reverse conve...