Pages that link to "Item:Q1079497"
From MaRDI portal
The following pages link to In a semi-infinite program only a countable subset of the constraints is essential (Q1079497):
Displaying 4 items.
- Strong duality and sensitivity analysis in semi-infinite linear programming (Q507336) (← links)
- Clark's theorem for semi-infinite convex programs (Q1150527) (← links)
- On the sufficiency of finite support duals in semi-infinite linear programming (Q1667165) (← links)
- Reduction and Discrete Approximation in Linear Semi-Infinite Programming (Q3780757) (← links)
