Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method (Q1963110): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 06:22, 5 March 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
