Optimality and duality for nonsmooth multiobjective fractional programming with mixed constraints
type: Item
instance of: scholarly article
title: Optimality and duality for nonsmooth multiobjective fractional programming with mixed constraints
zbMATH Open document ID: 1165.90031
published in: Journal of Global Optimization
publication date: 2008-07-25T00:00:00Z
review text: This article studies a multiobjective optimization problem where the objective functions are represented via fractions such as \(f_i(x)/g_i(x)\). This paper considers the case where the constraints of the problem are expressed as both equalities and inequalities and the necessary optimality conditions are derived. The article begins with an overview of the necessary terminology and background definitions and theorems. This is followed in section 3 by the main contribution of this paper, where the necessary and sufficient optimality conditions for this problem are derived. The next section then looks at the dual of this optimization problem and several useful theorems are presented with proof. The article concludes with a list of relevant references.
reviewed by: Efstratios Rappos
Mathematics Subject Classification ID: 90C46
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 49J52
zbMATH DE Number: 5304061
zbMATH Keywords: multiobjective fractional problems
zbMATH Keywords: efficient solution
zbMATH Keywords: mixed duality
zbMATH Keywords: nonsmooth analysis
author: S. Nobakhtian
MaRDI profile type: Publication
full work available at URL: s10898-007-9168-7
OpenAlex ID: W2094941914
cites work: Sufficiency and duality in multiobjective programming involving generalized \((F,\rho)\)-convexity
cites work: Sufficiency and duality in differentiable multiobjective programming involving generalized type I functions
cites work: Optimality conditions and duality in subdifferentiable multiobjective fractional programming
cites work: Optimality and duality for the multiobjective fractional programming with the generalized \((F,\rho)\) convexity.
cites work: Pseudolinearity and efficiency
cites work: Q4375488
cites work: Optimization and nonsmooth analysis
cites work: Nondifferentiable optimization by smooth approximations
cites work: Proper efficiency and the theory of vector maximization
cites work: Efficiency conditions and duality for a class of multiobjective fractional programming problems
cites work: Optimality and duality for multiobjective fractional programming involving nonsmooth($si:F$esi:ρ)–convex functions
cites work: Optimality and duality for multiobjective fractional programming involving nonsmooth pseudoinvex functions
cites work: A Multiplier Rule for Multiobjective Programming Problems with Continuous Data
cites work: Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems
cites work: Optimality and Duality for Invex Nonsmooth Multiobjective programming problems
cites work: Optimality and duality for nonsmooth multiobjective fractional programming with generalized invexity
cites work: Nondifferentiable multiobjective programming under generalized \(d\)-univexity
cites work: Mixed type duality for multiobjective variational problems
cites work: Infine functions and nonsmooth multiobjective optimization problems
cites work: Optimality criteria and duality in multiobjective programming involving nonsmooth invex functions
cites work: Nonsmooth invexity
cites work: Infine functions, nonsmooth alternative theorems and vector optimization problems
cites work: Strict lower semicontinuity of the level sets and invexity of a locally Lipschitz function
cites work: A duality theorem for non-linear programming
cites work: Generalised convexity and duality in multiple objective programming
cites work: Duality for a non-differentiable programming problem
cites work: Mixed type duality in multiobjective programming problems
DOI: 10.1007/S10898-007-9168-7
description: scientific article; zbMATH DE number 5304061