Some characterizations of robust optimal solutions for uncertain fractional optimization and applications
From MaRDI portal
Publication:2628185
DOI10.3934/jimo.2016047zbMath1364.90308OpenAlexW2509694544MaRDI QIDQ2628185
Hong-Yong Fu, Xiao-bing Li, Xian-Jun Long, Xiang-Kai Sun
Publication date: 12 June 2017
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2016047
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Fractional programming (90C32)
Related Items
Robust optimality, duality and saddle points for multiobjective fractional semi-infinite optimization with uncertain data, Unnamed Item, Characterizations of robust solution set of convex programs with uncertain data, Sequential optimality conditions of approximate proper efficiency for a multiobjective fractional programming problem, Weighted robust optimality of convex optimization problems with data uncertainty, On second-order conic programming duals for robust convex quadratic optimization problems, On semidefinite programming relaxations for a class of robust SOS-convex polynomial optimization problems, Characterizing robust weak sharp solution sets of convex optimization problems with uncertainty, Smoothing spline via optimal control under uncertainty, Optimal pricing strategies in a product and service supply chain with extended warranty service competition considering retailer fairness concern, Three concepts of robust efficiency for uncertain multiobjective optimization problems via set order relations, On robust approximate optimal solutions for fractional semi-infinite optimization with uncertainty data, Characterizing the Solution Set for Nonconvex Semi-Infinite Programs Involving Tangential Subdifferentials, Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems, Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On \(\epsilon\)-solutions for convex optimization problems with uncertainty data
- Augmented Lagrange primal-dual approach for generalized fractional programming problems
- Robust multiple objective game theory
- Optimality conditions for vector optimization problems with difference of convex maps
- Farkas-type results for constrained fractional programming with DC functions
- Robust fractional programming
- Duality and Farkas-type results for DC fractional programming with DC constraints
- Robust duality for fractional programming problems with constraint-wise data uncertainty
- On robust duality for fractional programming with uncertainty data
- New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces
- Duality in robust optimization: Primal worst equals dual best
- Some Farkas-type results for fractional programming problems with DC functions
- Conjugate duality in convex optimization
- Duality and saddle-point type optimality for generalized nonlinear fractional programming.
- \(\epsilon\)-formality and duality for fractional programming
- Symmetric duality for a class of nonlinear fractional programming problems
- Characterizing robust solution sets of convex programs under data uncertainty
- Sequential optimality conditions for fractional optimization with applications to vector optimization
- Strong duality for robust minimax fractional programming problems
- Farkas-type results for fractional programming problems
- On minimax fractional programming problems involving generalized \((H_p,r)\)-invex functions
- Theory and Applications of Robust Optimization
- Lectures on Stochastic Programming
- Bibliography in fractional programming
- Introduction to Stochastic Programming
- Fractional programming
- Optimality conditions and duality for a class of nonlinear fractional programming problems.
