A proof of the duality principle in linear programming

DOI10.21136/CPM.1985.118254MaRDI QIDQ3712118zbMATH OpenOpenAlexFDO

Authors L.Grygarova

Publication date 1985

Full work available at URL https://eudml.org/doc/21620

zbMATH Keywords

geometric approachconvex conesduality principlebipolaritytheorem

Mathematics Subject Classification ID

Linear programming (90C05) Duality theory (optimization) (49N15)

Recommendations

• scientific article; zbMATH DE number 4031395
• scientific article; zbMATH DE number 3897675
• scientific article; zbMATH DE number 3941266
• Derivation of duality in mathematical programming and optimization theory
• Duality in disjunctive programming via vector optimization

Cited in

(3)

• scientific article; zbMATH DE number 3941266 (Why is no real title available?)
• On duality and the maximum principle for continuous linear programming problems
• On a dual analogue of one linear problem of optimal observation

This page was built for publication: A proof of the duality principle in linear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3712118)