A decomposition method for quadratic programming

DOI10.1147/sj.311.0039zbMath0814.90095OpenAlexW2095076300MaRDI QIDQ4323676

David L. Jensen, Alan J. King

Publication date: 12 June 1995

Published in: IBM Systems Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1147/sj.311.0039

zbMATH Keywords

simplex algorithmconvex quadratic programmingoptimization subroutine library

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Quadratic programming (90C20) Packaged methods for numerical algorithms (65Y15)

Related Items (1)

On the number of securities which constitute an efficient portfolio

This page was built for publication: A decomposition method for quadratic programming