Polyextremal principles and separably-infinite programs
From MaRDI portal
characterization conditionscomplementarity conditionsduality theoryexistence of saddle pointinfinite number of constraintsinfinite number of variableslinear programming characterizationpolyextremal principlessaddle value problemssemi-infinite programmingseparably-infinite programstwo-person zero-sum constrained gamesuniextremal dual separably- infinite programs
Cites work
- A duality theory for convex programs with convex constraints
- Asymptotic cones and duality of linear relations
- Constrained Games and Linear Programming
- Convex Analysis
- scientific article; zbMATH DE number 3650305 (Why is no real title available?)
- scientific article; zbMATH DE number 3502079 (Why is no real title available?)
- scientific article; zbMATH DE number 3504650 (Why is no real title available?)
- scientific article; zbMATH DE number 3611068 (Why is no real title available?)
- scientific article; zbMATH DE number 3247810 (Why is no real title available?)
- scientific article; zbMATH DE number 3307201 (Why is no real title available?)
- scientific article; zbMATH DE number 3323651 (Why is no real title available?)
- Mathematical Programs with Optimization Problems in the Constraints
- Numerical treatment of a class of semi‐infinite programming problems
- Separably-infinite programs
This page was built for publication: Polyextremal principles and separably-infinite programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3898336)