Pages that link to "Item:Q3219365"
From MaRDI portal
The following pages link to Uniform duality in semi-infinite convex optimization (Q3219365):
Displayed 11 items.
- Robust linear semi-infinite programming duality under uncertainty (Q353146) (← links)
- Revisiting some rules of convex analysis (Q683299) (← links)
- Optimality conditions and duality for semi-infinite programming involving B-arcwise connected functions (Q1041446) (← links)
- In a semi-infinite program only a countable subset of the constraints is essential (Q1079497) (← links)
- Zero duality gaps in infinite-dimensional programming (Q1263531) (← links)
- Exact relaxations for parametric robust linear optimization problems (Q2294277) (← links)
- Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities (Q2474349) (← links)
- A duality theorem for semi-infinite convex programs and their finite subprograms (Q3308653) (← links)
- Optimality conditions for nondifferentiable convex semi-infinite programming (Q3308655) (← links)
- Reduction and Discrete Approximation in Linear Semi-Infinite Programming (Q3780757) (← links)
- Approximate solution in robust multi-objective optimization and its application in portfolio optimization (Q6065194) (← links)