Quadratic Programming with a Quasiconvex Objective Function

Béla Martos
Additional contact information
Béla Martos: Institute of Economics, Hungarian Academy of Sciences, Budapest, Hungary

Operations Research, 1971, vol. 19, issue 1, 87-97

Abstract: This paper gives both necessary and sufficient conditions for a quadratic function to be quasiconvex in the nonnegative orthant. Methods of pseudoconvex programming (such as those of Frank and Wolfe) can solve linearly constrained quadratic programming problems with such an objective function.

Date: 1971
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.19.1.87 (application/pdf)

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:inm:oropre:v:19:y:1971:i:1:p:87-97

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().