The discrete max‐min problem

P. H. Randolph and G. E. Swinson

Naval Research Logistics Quarterly, 1969, vol. 16, issue 3, 309-314

Abstract: The historic max‐min problem is examined as a discrete process rather than in its more usual continuous mode. Since the practical application of the max‐min model usually involves discrete objects such as ballistic missiles, the discrete formulation of the problem seems quite appropriate. This paper uses an illegal modification to the dynamic programming process to obtain an upper bound to the max‐min value. Then a second but legal application of dynamic programming to the minimization part of the problem for a fixed maximizing vector will give a lower bound to the max‐min value. Concepts of optimal stopping rules may be applied to indicate when sufficiently near optimal solutions have been obtained.

Date: 1969
References: Add references at CitEc
Citations:

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

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:16:y:1969:i:3:p:309-314

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 ().