Results 101 to 110 of about 81,930 (160)

Optimality Conditions for Vector Optimization Problems

Journal of Optimization Theory and Applications, 2009
The paper considers vector optimization problems (VOP) of the form \[ \min F(x) \text{ subject to } u_i(x) \leq 0, i\in\{1, \dots, m\}; v_j(x) =0, j\in\{1, \dots, n\}, \] where \(F:X \rightarrow \mathbb{R}^L\) and \(u_i, v_j: X\rightarrow \mathbb{R}\) and \(X\) is a Banach space.
Huang, N. J., Li, J., Wu, S. Y.
openaire   +1 more source

Vector Optimization Problems via Improvement Sets

Journal of Optimization Theory and Applications, 2011
The authors introduce the concept of improvement sets and optimal points with respect to the preference relation given by an improvement set (a nonempty set \(E\) in \(\mathbb R^n\) is called an improvement set if it does not contain the origin and has a free disposal property: \(E+\mathbb R^n_+ \subseteq E\); and a point \(a\) of a nonempty set \(A ...
CHICCO, MAURIZIO   +3 more
openaire   +2 more sources

Vector equilibrium problem and vector optimization

European Journal of Operational Research, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Goh, C. J., Yang, X. Q.
openaire   +1 more source

Scalarizing vector optimization problems

Journal of Optimization Theory and Applications, 1984
A scalarization of vector optimization problems is proposed, where optimality is defined through convex cones. By varying the parameters of the scalar problem, it is possible to find all vector optima from the scalar ones. Moreover, it is shown that, under mild assumptions, the dependence is differentiable for smooth objective maps defined over ...
A. PASCOLETTI, SERAFINI, Paolo
openaire   +2 more sources

An Algorithm for Vector Optimization Problems

Bulletin of the Malaysian Mathematical Sciences Society, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gong, Xun-Hua, Liu, Fang
openaire   +1 more source

Optimality Conditions for C1,1 Vector Optimization Problems

Journal of Optimization Theory and Applications, 2001
This note deals with the problem of minimizing a vector-valued function \(f: \mathbb{R}^m \to \mathbb{R}^n\), where the order in \(\mathbb{R}^n\) is given by a certain closed convex pointed cone \(K\). The function \(f\) is assumed to be of class \(C^{1,1}\).
GUERRAGGIO, ANGELO, LUC DT
openaire   +2 more sources

Home - About - Disclaimer - Privacy