Optimality conditions for vector mathematical programming via a theorem of the alternative
type: Item
instance of: scholarly article
title: Optimality conditions for vector mathematical programming via a theorem of the alternative
zbMATH Open document ID: 0946.90074
published in: Journal of Mathematical Analysis and Applications
publication date: 2000-10-03T00:00:00Z
review text: 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\).
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C46
Mathematics Subject Classification ID: 49J52
Mathematics Subject Classification ID: 90C32
zbMATH DE Number: 1289958
zbMATH Keywords: nonconvex vector mathematical programming
zbMATH Keywords: vector fractional mathematical programming
author: Ahmed Taa
MaRDI profile type: Publication
full work available at URL: jmaa.1999.6288
OpenAlex ID: W2041075185
cites work: On Lagrance-Kuhn-Tucker Mulitipliers for Muliobjective Optimization Problems
cites work: Sufficient conditions of optimality for multiobjective optimization problems with γ-paraconvex data
cites work: Fractional programming without differentiability
cites work: Pareto optimality in multiobjective problems
cites work: Q4000274
cites work: Existence and continuity of solutions for vector optimization
cites work: Optimality conditions for maximizations of set-valued functions
cites work: A generalization of a minimax theorem of Fan via a theorem of the alternative
cites work: Maximal vectors and multi-objective optimization
cites work: Contingent derivatives of set-valued maps and applications to vector optimization
cites work: Invex optimisation problems
cites work: Weak Pareto-optimal necessary conditions in a nondifferentiable multiobjective program on a Banach space
cites work: Theory of multiobjective optimization
cites work: Necessary and sufficient condiitions for multiobjective optimization problems
cites work: Set-valued derivatives of multifunctions and optimality conditions
cites work: Scalarization and lagrange duality in multiobjective optimization
DOI: 10.1006/JMAA.1999.6288
description: scientific article; zbMATH DE number 1289958