Pages that link to "Item:Q2628185"
From MaRDI portal
The following pages link to Some characterizations of robust optimal solutions for uncertain fractional optimization and applications (Q2628185):
Displaying 17 items.
- On \(\epsilon\)-solutions for robust fractional optimization problems (Q261808) (← links)
- Characterizations of robust solution set of convex programs with uncertain data (Q1670545) (← links)
- On robust approximate optimal solutions for fractional semi-infinite optimization with uncertainty data (Q2067760) (← links)
- Robust optimality, duality and saddle points for multiobjective fractional semi-infinite optimization with uncertain data (Q2136884) (← links)
- Weighted robust optimality of convex optimization problems with data uncertainty (Q2191283) (← links)
- Characterizing robust weak sharp solution sets of convex optimization problems with uncertainty (Q2244235) (← links)
- Smoothing spline via optimal control under uncertainty (Q2295322) (← links)
- Optimal pricing strategies in a product and service supply chain with extended warranty service competition considering retailer fairness concern (Q2298915) (← links)
- Three concepts of robust efficiency for uncertain multiobjective optimization problems via set order relations (Q2313759) (← links)
- Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems (Q2322364) (← links)
- Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints (Q2338487) (← links)
- Robust approach for uncertain multi-dimensional fractional control optimization problems (Q2688901) (← links)
- (Q4964825) (← links)
- Characterizing the Solution Set for Nonconvex Semi-Infinite Programs Involving Tangential Subdifferentials (Q4985185) (← links)
- Sequential optimality conditions of approximate proper efficiency for a multiobjective fractional programming problem (Q6067531) (← links)
- On second-order conic programming duals for robust convex quadratic optimization problems (Q6160375) (← links)
- On semidefinite programming relaxations for a class of robust SOS-convex polynomial optimization problems (Q6200383) (← links)
