Understanding linear semi-infinite programming via linear programming over cones (Q3066933): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Regularizing the abstract convex program / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Haar's dual problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Linear semi-infinite programming theory: an updated survey / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Semi-Infinite Programming: Theory, Methods, and Applications / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Strong Duality for Semidefinite Programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some applications of optimization in matrix theory / rank | |||
Normal rank | |||
Latest revision as of 17:02, 3 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Understanding linear semi-infinite programming via linear programming over cones |
scientific article |
Statements
Understanding linear semi-infinite programming via linear programming over cones (English)
0 references
20 January 2011
0 references
linear semi-infinite programming
0 references
duality
0 references
geometry of the feasible set
0 references
optimality conditions
0 references
