On the minimization of a certain convex function arising in applied decision theory

W. A. Ericson

Naval Research Logistics Quarterly, 1968, vol. 15, issue 1, 33-48

Abstract: The author, in an expository paper [4], has presented an algorithm for choosing a non‐negative vector to minimize the function subject to the constraint , where are given vectors and {\rm \vec M} is positive definite symmetric. In this paper a derivation of this algorithm is presented, including an exact solution in a degenerate case, only alluded to in [4], Several applications, in addition to that of [4], are briefly indicated.

Date: 1968
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800150104

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:15:y:1968:i:1:p:33-48

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().