A simple proof of a general duality theorem of convex programming (Q5592012): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Duality Theorem for Convex Programs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A DUALITY THEOREM IN NON-LINEAR PROGRAMMING WITH NON-LINEAR CONSTRAINTS1 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Dual Programs [Letter to the Editor] / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5806966 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A GENERAL DUALITY THEOREM OF CONVEX PROGRAMMING * / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A duality theorem for non-linear programming / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 00:41, 12 June 2024
scientific article; zbMATH DE number 3311488
Language | Label | Description | Also known as |
---|---|---|---|
English | A simple proof of a general duality theorem of convex programming |
scientific article; zbMATH DE number 3311488 |
Statements
A simple proof of a general duality theorem of convex programming (English)
0 references
1969
0 references
operations research
0 references