Mathematical Programs with Optimization Problems in the Constraints

Jerome Bracken and James T. McGill
Additional contact information
Jerome Bracken: Institute for Defense Analyses, Arlington, Virginia
James T. McGill: Institute for Defense Analyses, Arlington, Virginia

Operations Research, 1973, vol. 21, issue 1, 37-44

Abstract: This paper considers a class of optimization problems characterized by constraints that themselves contain optimization problems. The problems in the constraints can be linear programs, nonlinear programs, or two-sided optimization problems, including certain types of games. The paper presents theory dealing primarily with properties of the relevant functions that result in convex programming problems, and discusses interpretations of this theory. It gives an application with linear programs in the constraints, and discusses computational methods for solving the problems.

Date: 1973
References: Add references at CitEc
Citations: View citations in EconPapers (64)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.21.1.37 (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:1:p:37-44

Access Statistics for this article

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