Nondifferentiable fractional semi-infinite multiobjective optimization problems

DOI10.1016/j.orl.2016.02.003zbMath1408.90271OpenAlexW2271909439MaRDI QIDQ1785759

Thai Doan Chuong

Publication date: 1 October 2018

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2016.02.003

zbMATH Keywords

dualityoptimality conditionlimiting subdifferentialgeneralized convex functionfractional semi-infinite multiobjective programming

Mathematics Subject Classification ID

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

Related Items (13)

Normal regularity for the feasible set of semi-infinite multiobjective optimization problems with applications ⋮ Robust optimality, duality and saddle points for multiobjective fractional semi-infinite optimization with uncertain data ⋮ On \(\varepsilon\)-quasi efficient solutions for fractional infinite multiobjective optimization problems with locally Lipschitz data ⋮ Approximate optimality conditions and approximate duality theorems for nonlinear semi-infinite programming problems with uncertainty data ⋮ Approximate optimal solutions for multiobjective optimization problems with infinite constraints ⋮ On isolated/properly efficient solutions in nonsmooth robust semi-infinite multiobjective optimization ⋮ On optimality conditions and duality theorems for approximate solutions of nonsmooth infinite optimization problems ⋮ Robust alternative theorem for linear inequalities with applications to robust multiobjective optimization ⋮ On the Mangasarian-Fromovitz constraint qualification and Karush-Kuhn-Tucker conditions in nonsmooth semi-infinite multiobjective programming ⋮ On solving a class of fractional semi-infinite polynomial programming problems ⋮ An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems ⋮ Optimality conditions for minimax optimization problems with an infinite number of constraints and related applications ⋮ Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Isolated and proper efficiencies in semi-infinite vector optimization problems
• A class of nonsmooth fractional multiobjective optimization problems
• Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
• Optimality and duality for the multiobjective fractional programming with the generalized \((F,\rho)\) convexity.
• Nonsmooth semi-infinite multiobjective optimization problems
• Farkas-type results for fractional programming problems
• Necessary conditions in multiobjective optimization with equilibrium constraints
• Optimality for nonsmooth fractional multiple objective programming
• Optimality and duality in multiobjective fractional programming involving \(\rho\)-semilocally type I-preinvex and related functions
• Subdifferentials of Marginal Functions in Semi-infinite Programming
• Duality for non smooth non linear fractional multiobjective programs via (F,ρ) - convexity
• On Nonlinear Fractional Programming
• Optimality and duality for nonsmooth multiobjective fractional programming with generalized invexity

This page was built for publication: Nondifferentiable fractional semi-infinite multiobjective optimization problems