Duality for fractional interval-valued bilevel optimization problems
From MaRDI portal
Cites work
- A duality theorem for non-linear programming
- Bilevel optimization with a multi-objective lower-level problem: risk-neutral and risk-averse formulations
- Convexifactors, generalized convexity and vector optimization
- Convexifactors, generalized convexity, and optimality conditions
- Duality for multiple objective fractional subset programming with generalized \((\Gamma\mkern-15mu-,\rho,\sigma,\theta)\)-V-Type-I functions
- Duality for nonsmooth optimization problems with equilibrium constraints, using convexificators
- Duality in nonlinear fractional programming
- Duality results for interval-valued semiinfinite optimization problems with equilibrium constraints using convexificators
- Duality theory in interval-valued linear programming problems
- Duality-based single-level reformulations of bilevel optimization problems
- Efficiency conditions and duality for a class of multiobjective fractional programming problems
- Generalized \(\alpha \)-univexity and duality for nondifferentiable minimax fractional programming
- Generalized convex composite multi-objective nonsmooth programming and conditional proper efficiency
- Generalized fractional programming problems containing locally subdifferentiable andρ-Univex functions
- Higher-order Mond-Weir duality for set-valued optimization
- scientific article; zbMATH DE number 3856842 (Why is no real title available?)
- scientific article; zbMATH DE number 734930 (Why is no real title available?)
- Multiple objective fractional programming involving semilocally type I-preinvex and related functions
- Necessary and Sufficient Optimality Conditions for Fractional Interval-Valued Optimization Problems
- Necessary optimality conditions in terms of convexificators in Lipschitz optimization
- Nondifferentiable minimax fractional programming under generalized univexity
- Nonlinear Programming
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- Nonsmooth minimax fractional programming involving {\(\eta\)}-pseudolinear functions
- On characterizations of solution sets of interval-valued quasiconvex programming problems
- On interval-valued bilevel optimization problems using upper convexificators
- On nondifferentiable minimax fractional programming under generalized -type I invexity
- On nonlinear multiple objective fractional programming involving semilocally type-I univex functions
- On the partial calmness condition for an interval-valued bilevel optimization problem
- Optimality and duality for minimax fractional programming with support function under (C, , , d)-convexity
- Optimality and duality results for a nondifferentiable multiobjective fractional programming problem
- Optimality and duality results for bilevel programming problem using convexifactors
- Optimality and duality results for fractional programming problems under E-univexity
- Optimality conditions and duality results for a robust bi-level programming problem
- Optimality Conditions Using Convexifactors for a Multiobjective Fractional Bilevel Programming Problem
- Optimality, duality and saddle point analysis for interval-valued nondifferentiable multiobjective fractional programming problems
- Uncertain random bilevel programming models and their application to shared capacity routing problem
This page was built for publication: Duality for fractional interval-valued bilevel optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7363598)
