Über den Aufwand zur Lösung quadratischer Optimierungsprobleme mit den Algorithmen von Beale und von Lemke

DOI10.1007/BF01953145MaRDI QIDQ4770784zbMATH OpenOpenAlexFDO

Authors

Publication date 1974

Published in Zeitschrift für Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01953145

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20)

Cites work

• scientific article; zbMATH DE number 3332061 (Why is no real title available?)
• A comparison of the primal‐simplex and complementary pivot methods for linear programming

Cited in

(1)

• A decomposition algorithm for quadratic programming

This page was built for publication: Über den Aufwand zur Lösung quadratischer Optimierungsprobleme mit den Algorithmen von Beale und von Lemke

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