A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions (Q1025998)
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: A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions |
scientific article; zbMATH DE number 5569110
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions |
scientific article; zbMATH DE number 5569110 |
Statements
A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions (English)
0 references
23 June 2009
0 references
reformulation-linearization technique
0 references
RLT
0 references
semi-infinite programs
0 references
convex discrete programs
0 references
mixed 0-1 programs
0 references
mixed-discrete programs
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
