Optimality conditions for multiobjective fractional programming, via convexificators

DOI10.3934/jimo.2018170zbMath1449.90333OpenAlexW2896219807WikidataQ128982118 ScholiaQ128982118MaRDI QIDQ781069

Soghra Nobakhtian, Mansoureh Alavi Hejazi

Publication date: 16 July 2020

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2018170

zbMATH Keywords

necessary optimality conditionsnonsmooth analysisconvexificatormultiobjective fractional optimization problem

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52) Fractional programming (90C32)

Related Items (4)

A study on vector variational-like inequalities using convexificators and application to its bi-level form ⋮ Unnamed Item ⋮ Constraint qualifications in terms of convexificators for nonsmooth programming problems with mixed constraints ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonlinear augmented Lagrangian for nonconvex multiobjective optimization
• Convexificators and strong Kuhn-Tucker conditions
• Stronger Kuhn-Tucker type conditions in nonsmooth multiobjective optimization: Locally Lipschitz case
• Optimality and duality for nonsmooth multiobjective fractional programming with mixed constraints
• An approach to controlled mechanical systems based on the multiobjective optimization technique
• Optimality conditions, duality and saddle points for nondifferentiable multiobjective fractional programs
• A generalized derivative for calm and stable functions
• Nonsmooth calculus, minimality, and monotonicity of convexificators
• Hunting for a smaller convex subdifferential
• Efficiency conditions and duality for a class of multiobjective fractional programming problems
• Componentwise versus global approaches to nonsmooth multiobjective optimization
• Necessary and sufficient optimality conditions for fractional multi-objective problems
• Optimization and nonsmooth analysis
• Approximate Jacobian Matrices for Nonsmooth Continuous Maps and C¹-Optimization
• Variational Analysis
• Convexifactors, generalized convexity and vector optimization
• The Linear Nonconvex Generalized Gradient and Lagrange Multipliers
• Convexificators and necessary conditions for efficiency
• Nonlinear Programming

This page was built for publication: Optimality conditions for multiobjective fractional programming, via convexificators