The complementary unboundedness of dual feasible solution sets in convex programming (Q4138493): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the primal and dual constraint sets in geometric programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remark on the Constraint Sets in Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual Programs and Minimum Cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrange multipliers and nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric Duality for Generalized Unconstrained Geometric Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality and stability in extremum problems involving convex functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5639522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boundedness relations for linear constraint sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementarity Theorems for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A duality theorem for non-linear programming / rank
 
Normal rank

Latest revision as of 21:02, 12 June 2024

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