A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions (Q1025998): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:12, 30 January 2024
scientific article
| 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 |
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
