Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method (Q1963110)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method |
scientific article; zbMATH DE number 1391636
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method |
scientific article; zbMATH DE number 1391636 |
Statements
Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method (English)
0 references
20 January 2000
0 references
convex semi-infinite programming
0 references
cutting plane method
0 references
duality theory
0 references
