Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method (Q1963110): Difference between revisions
From MaRDI portal
Latest revision as of 10:17, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method |
scientific article |
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