Duality for fractional interval-valued optimization problem via convexificator

DOI10.1007/S12597-022-00617-WMaRDI QIDQ6105961zbMATH OpenOpenAlexFDO

Authors B. Japamala Rani, Krishna Kummari

Publication date 26 June 2023

Published in Opsearch (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s12597-022-00617-w

zbMATH Keywords

convexificatordualityfractional problemLagrange functionsLu optimal solution

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A Decomposition Method for Interval Linear Programming
• Duality theory for optimization problems with interval-valued objective functions
• Duality theory in interval-valued linear programming problems
• Necessary and sufficient optimality conditions for fractional multi-objective problems
• Non-smooth optimization methods for computation of the Conditional Value-at-risk and portfolio optimization
• Nonsmooth calculus, minimality, and monotonicity of convexificators
• Nonsmooth optimization using Mordukhovich's subdifferential
• On interval-valued nonlinear programming problems
• On Minty variational principle for nonsmooth vector optimization problems with generalized approximate convexity
• Optimality and duality for generalized fractional programming involving nonsmooth pseudoindex functions
• Optimality and duality for multiobjective nonsmooth programming
• Optimality and duality in constrained interval-valued optimization
• Optimality condition and mixed duality for interval-valued optimization
• Optimality condition and Wolfe duality for invex interval-valued nonlinear programming problems
• Optimality conditions and duality for interval-valued optimization problems using convexifactors
• Solving fixed charge transportation problem with interval parameters
• Wolfe duality for interval-valued optimization

Cited in

(6)

• scientific article; zbMATH DE number 7347482 (Why is no real title available?)
• Sufficient optimality, duality and saddle point analysis in terms of convexificators for nonsmooth robust fractional interval-valued optimization problems
• On interval-valued value function for fractional optimization problems
• A generalized division approach for interval fractional programming problems
• Schaible and Bector type robust \(\mathbb{E}_{\mathbb{R}}\)-duality for robust fractional interval-valued optimization problems
• A new approach for solving multi-objective interval-valued variational problems and its applications

This page was built for publication: Duality for fractional interval-valued optimization problem via convexificator

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