Optimality conditions for vector mathematical programming via a theorem of the alternative
The paper is concerned with the optimality conditions for the following nonsmooth and nonconvex vector mathematical programming: \[ \begin{matrix} &\qquad &\qquad {\l}\\ (P) & \text{Minimize} & f(x)=(f_1(x), \ldots, f_q(x)) \\ &\text{subject to} & g_{i}(x)\leq{0}, \quad i=1, \ldots, m\\ & & x\in{\Omega}, \end{matrix} \] where \(f:R^{N}\rightarrow{R^q}\), \(g:R^{N}\rightarrow{R^m}\) with \(g=(g_1, \ldots, g_m)\) and \(\Omega\) is a nonempty subset of \(R^N\). By using a generalization of the Gordan alternative theorem given by \textit{V. Jeyakumar} [J. Optim. Theory Appl. 48, 525-533 (1986; Zbl 0578.49008)], the author proves the Lagrange multipliers type of optimal condition for problem~\((P)\) under the assumption of the existence and cone-subconvexlikeness of the Hadamard directional derivatives of objective and constraint functions. Based on convexity on \(f_i\), \(g_j\), and \(\Omega\), the sufficient optimality conditions of problem~\((P)\) is established, too. Moreover, the paper gives an application to the following vector fractional mathematical programming problem: \[ \begin{matrix} &\qquad &\qquad {\l}\\ (FP) & \text{Minimize} & \left(f_1(x)/g_1(x), \ldots, f_q(x)/g_q(x)\right) \\ &\text{subject to} & x\in{\Omega}, \quad h_{i}(x)\leq{0}, \quad i=1, \ldots, m, \end{matrix} \] where \(f_i:R^{N}\rightarrow{R}\) (\(i=1, \ldots, q\)), \(h_j:R^{N}\rightarrow{R}\) (\(j=1, \ldots, m\)) are continuous, convex, and finite at \(\bar{x}\in{S}\), and \(g_i:R^{N}\rightarrow{R}\) (\(i=1, \ldots, q\)) are continuous, concave, finite at \(\bar{x}\), and positive on \(S\).
- scientific article; zbMATH DE number 4176847
- Some Optimality Conditions in Vector Optimization
- The generalized optimality conditions of multiobjective programming problem in topological vector space.
- An optimal alternative theorem and applications to mathematical programming
- scientific article; zbMATH DE number 1383177
- A generalization of a minimax theorem of Fan via a theorem of the alternative
- Contingent derivatives of set-valued maps and applications to vector optimization
- Existence and continuity of solutions for vector optimization
- Fractional programming without differentiability
- scientific article; zbMATH DE number 50640 (Why is no real title available?)
- Invex optimisation problems
- Maximal vectors and multi-objective optimization
- Necessary and sufficient condiitions for multiobjective optimization problems
- On Lagrance-Kuhn-Tucker Mulitipliers for Muliobjective Optimization Problems
- Optimality conditions for maximizations of set-valued functions
- Pareto optimality in multiobjective problems
- Scalarization and lagrange duality in multiobjective optimization
- Set-valued derivatives of multifunctions and optimality conditions
- Sufficient conditions of optimality for multiobjective optimization problems with γ-paraconvex data
- Theory of multiobjective optimization
- Weak Pareto-optimal necessary conditions in a nondifferentiable multiobjective program on a Banach space
- A sixth bibliography of fractional programming
- scientific article; zbMATH DE number 4097143 (Why is no real title available?)
- The vector exact \(l_{1}\) penalty method for nondifferentiable convex multiobjective programming problems
- Dini and Hadamard directional derivatives in multiobjective optimization: an overview of some results
- Karush-Kuhn-Tucker necessary optimality conditions for (h, )_-multiobjective optimization problems based on Pseudo-Avriel-Ben-Tal algebraic operations
- Optimality conditions for vector optimization problems of a difference of convex mappings
- Higher-order optimality conditions for set-valued optimization
- An optimal alternative theorem and applications to mathematical programming
This page was built for publication: Optimality conditions for vector mathematical programming via a theorem of the alternative
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1289048)
