Sufficient optimality, duality and saddle point analysis in terms of convexificators for nonsmooth robust fractional interval-valued optimization problems

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Convexifactors, generalized convexity, and optimality conditions
Selected topics in robust convex optimization
Nonsmooth calculus, minimality, and monotonicity of convexificators
Optimality conditions and duality in subdifferentiable multiobjective fractional programming
On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems
Robust multiobjective optimization with application to Internet routing
Robust necessary optimality conditions for nondifferentiable complex fractional programming with uncertain data
Optimality and duality for multi-objective fractional programming in complex spaces
Sufficiency and duality in non-smooth interval valued programming problems
On interval-valued nonlinear programming problems
Theory and Applications of Robust Optimization
Necessary and sufficient optimality conditions for fractional multi-objective problems
Necessary and Sufficient Optimality Conditions for Fractional Interval-Valued Optimization Problems
Convexifactors, generalized convexity and vector optimization
Optimality, duality and saddle point analysis for interval-valued nondifferentiable multiobjective fractional programming problems
Duality for a class of nonsmooth multiobjective programming problems using convexificators
Optimality and duality for nonsmooth minimax programming problems using convexifactor
Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
Optimality and duality for nonsmooth multiobjective fractional programming with generalized invexity
Optimality, duality and saddle point criteria for a robust fractional interval-valued optimization problem with uncertain inequality constraints via convexificators
Duality for fractional interval-valued optimization problem via convexificator

This page was built for publication: Sufficient optimality, duality and saddle point analysis in terms of convexificators for nonsmooth robust fractional interval-valued optimization problems

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