Optimality conditions for multiobjective fractional programming, via convexificators

DOI10.3934/JIMO.2018170zbMATH Open1449.90333OpenAlexW2896219807WikidataQ128982118 ScholiaQ128982118MaRDI QIDQ781069FDOQ781069

S. 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

nonsmooth analysisnecessary optimality conditionsconvexificatormultiobjective fractional optimization problem

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (16)

• The Karush–Kuhn–Tucker conditions for multiple objective fractional interval valued optimization problems
• Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions
• Optimality conditions for multiple objective fractional subset programming with \((\rho,\sigma,\theta )\)-type-I and related non-convex functions
• Optimality conditions and duality in subdifferentiable multiobjective fractional programming
• Title not available (Why is that?)
• Constraint qualifications in terms of convexificators for nonsmooth programming problems with mixed constraints
• Biconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem
• On \(\varepsilon\)-optimality conditions for multiobjective fractional optimization problems
• On approximate strong KKT points of nonsmooth interval-valued mutiobjective optimization problems using convexificators
• Necessary optimality conditions for a fractional multiobjective optimization problem
• Constraint qualifications and optimality conditions for nonsmooth multiobjective mathematical programming problems with vanishing constraints on Hadamard manifolds via convexificators
• A study on vector variational-like inequalities using convexificators and application to its bi-level form
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Sequential optimality conditions of approximate proper efficiency for a multiobjective fractional programming problem

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Multiobjective fractional programming with generalized convexity 👍 👎
• Optimality conditions and duality for nondifferentiable multiobjective fractional programming with generalized convexity 👍 👎
• Necessary and sufficient optimality conditions for fractional multi-objective problems 👍 👎
• The \(\varepsilon\)-optimality conditions for multiobjective fractional programming problems 👍 👎
• Optimality Conditions and Duality for Nondifferentiable Multiobjective Fractional Programming Problems 👍 👎
• Optimality Conditions Using Convexifactors for a Multiobjective Fractional Bilevel Programming Problem 👍 👎

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q781069)