Defense Applications of 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: Illinois Board of Higher Education, Springfield, Illinois

Operations Research, 1974, vol. 22, issue 5, 1086-1096

Abstract: Bracken and McGill have discussed the theory, computations, and an example of mathematical programming models with optimization problems in the constraints [ Opns. Res. 21, 37–44 (1973)], and have presented a computer program for solving such models with nonlinear programs in the constraints [ Opns. Res. 22, 1097–1101 (1974)]. Bracken, Falk, and McGill have given a procedure for transforming mathematical programs with two-sided optimization problems in the constraints into mathematical programs with nonlinear programs in the constraints [ Opns. Res. 22, 1102–1104 (1974)], thus enabling their solution by the computer program. This paper formulates models of defense problems that are convex programs having the mathematical properties treated in the previous papers. The models include several strategic-force-planning models and two general-purpose-force planning models.

Date: 1974
References: Add references at CitEc
Citations: View citations in EconPapers (10)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.22.5.1086 (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:22:y:1974:i:5:p:1086-1096

Access Statistics for this article

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