Approximate Karush-Kuhn-Tucker conditions for multiobjective fractional programming problems

DOI10.3934/JIMO.2024189MaRDI QIDQ6854870zbMATH OpenFDO

Authors Xin Deng, Yingxue Yang, Liping Tang

Publication date 23 February 2026

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

Full work available at URL https://doi.org/10.3934/JIMO.2024189

zbMATH Keywords

approximate Karush-Kuhn-Tucker conditioncomplementary approximate Karush-Kuhn-Tucker conditionmultiobjective fractional programming problems

Mathematics Subject Classification ID

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

Cites work

• A cone-continuity constraint qualification and algorithmic consequences
• A new sequential optimality condition for constrained optimization and algorithmic consequences
• A taxonomy and review of the multi-objective fractional programming (MOFP) problems
• An approximate strong KKT condition for multiobjective optimization
• Approximate Karush-Kuhn-Tucker condition in multiobjective optimization
• Approximate KKT points and a proximity measure for termination
• Bibliography: Ninth bibliography of fractional programming
• Characterizing FJ and KKT conditions in nonconvex mathematical programming with applications
• Constraint qualifications for Karush-Kuhn-Tucker conditions in multiobjective optimization
• Generalized convex duality for multiobjective fractional programs
• scientific article; zbMATH DE number 4010155 (Why is no real title available?)
• Multiobjective fractional programming duality theory
• Nonlinear Programming
• On approximate KKT condition and its extension to continuous variational inequalities
• Optimality and duality for generalized fractional programming involving nonsmooth \((F,\rho)\)-convex functions
• Optimality and duality for nonsmooth multiobjective fractional programming with generalized invexity
• Optimality and duality results for \(E\)-differentiable multiobjective fractional programming problems under \(E\)-convexity
• Optimality conditions and duality for a class of nondifferentiable multi-objective fractional programming problems
• Optimality conditions and duality in subdifferentiable multiobjective fractional programming
• Optimization and nonsmooth analysis
• Proper efficiency and the theory of vector maximization
• Saddle point criteria in multiobjective fractional programming involving exponential invexity
• Sufficiency and duality in nondifferentiable multiobjective fractional programming with higher-order \((V, \alpha, \rho, \theta)\)-invexity

This page was built for publication: Approximate Karush-Kuhn-Tucker conditions for multiobjective fractional programming problems

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