A Note on a Conjecture of Mantel Concerning Quadratic Programming
作者:
CharlesE. Antle,
LawrenceA. Klimko,
期刊:
Technometrics
(Taylor Available online 1971)
卷期:
Volume 13,
issue 2
页码: 425-427
ISSN:0040-1706
年代: 1971
DOI:10.1080/00401706.1971.10488796
出版商: Taylor & Francis Group
数据来源: Taylor
摘要:
The problem considered is that of minimizing a positive definite quadratic form subject to linear constraints. Mantel has conjectured that the constrained minimum must lie on that boundary which is farthest from the unconstrained minimum, where distance is measured by means of the given quadratic form. A counter-example is given.
点击下载:
PDF (1365KB)
返 回