Optimality conditions for multiobjective fractional programming, via convexificators
type: Item
instance of: scholarly article
title: Optimality conditions for multiobjective fractional programming, via convexificators
zbMATH Open document ID: 1449.90333
author: S. Nobakhtian
author: Mansoureh Alavi Hejazi
published in: Journal of Industrial and Management Optimization
publication date: 2020-07-16T00:00:00Z
Mathematics Subject Classification ID: 90C32
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 49J52
Mathematics Subject Classification ID: 90C46
zbMATH DE Number: 7221668
zbMATH Keywords: multiobjective fractional optimization problem
zbMATH Keywords: convexificator
zbMATH Keywords: necessary optimality conditions
zbMATH Keywords: nonsmooth analysis
MaRDI profile type: Publication
full work available at URL: jimo.2018170
OpenAlex ID: W2896219807
cites work: An approach to controlled mechanical systems based on the multiobjective optimization technique
cites work: Nonlinear Programming
cites work: Componentwise versus global approaches to nonsmooth multiobjective optimization
cites work: Optimization and nonsmooth analysis
cites work: Nonlinear augmented Lagrangian for nonconvex multiobjective optimization
cites work: Hunting for a smaller convex subdifferential
cites work: Q4875353
cites work: Convexifactors, generalized convexity and vector optimization
cites work: Necessary and sufficient optimality conditions for fractional multi-objective problems
cites work: Convexificators and strong Kuhn-Tucker conditions
cites work: Approximate Jacobian Matrices for Nonsmooth Continuous Maps and C1-Optimization
cites work: Nonsmooth calculus, minimality, and monotonicity of convexificators
cites work: Stronger Kuhn-Tucker type conditions in nonsmooth multiobjective optimization: Locally Lipschitz case
cites work: Efficiency conditions and duality for a class of multiobjective fractional programming problems
cites work: Optimality conditions, duality and saddle points for nondifferentiable multiobjective fractional programs
cites work: Convexificators and necessary conditions for efficiency
cites work: A generalized derivative for calm and stable functions
cites work: Q4856868
cites work: Optimality and duality for nonsmooth multiobjective fractional programming with mixed constraints
cites work: Variational Analysis
cites work: Q3320150
cites work: The Linear Nonconvex Generalized Gradient and Lagrange Multipliers
Wikidata QID: Q128982118
DOI: 10.3934/JIMO.2018170
Recommended article: Q3073203
Recommended article: Q5199598
Recommended article: Multiobjective fractional programming with generalized convexity
Recommended article: Necessary and sufficient optimality conditions for fractional multi-objective problems
Recommended article: The \(\varepsilon\)-optimality conditions for multiobjective fractional programming problems
Recommended article: Q3183648
Recommended article: Optimality conditions and duality for nondifferentiable multiobjective fractional programming with generalized convexity
Recommended article: Optimality Conditions and Duality for Nondifferentiable Multiobjective Fractional Programming Problems
Recommended article: Optimality Conditions Using Convexifactors for a Multiobjective Fractional Bilevel Programming Problem
Recommended article: Q5061995
description: scientific article; zbMATH DE number 7221668