The complementary unboundedness of dual feasible solution sets in convex programming (Q4138493)

From MaRDI portal
Revision as of 21:02, 12 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article; zbMATH DE number 3566562
Language Label Description Also known as
English
The complementary unboundedness of dual feasible solution sets in convex programming
scientific article; zbMATH DE number 3566562

    Statements

    Identifiers