Technical Note—Decomposition Techniques for the Chebyshev Problem

Roger A. Blau
Additional contact information
Roger A. Blau: University of North Carolina, Chapel Hill, North Carolina

Operations Research, 1973, vol. 21, issue 5, 1157-1163

Abstract: This note investigates a decomposition procedure for the problem of maximizing the minimum of a finite number of functions over a common domain. Results, in the form of nonlinear programming subproblems with linear contraints, are obtained for two different classes of functions with domains defined by convex polyhedra. The relation between the subproblems for both classes of functions is shown.

Date: 1973
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.21.5.1157 (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:21:y:1973:i:5:p:1157-1163

Access Statistics for this article

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