Technical Note—A Note on the One Against Many Battle

Kensaku Kikuta
Additional contact information
Kensaku Kikuta: Toyama University, Toyama, Japan

Operations Research, 1983, vol. 31, issue 5, 952-956

Abstract: This paper treats a sequencing problem that appears in the one-against-many engagement, considered originally by Friedman. We define an extremal order to be an order that satisfies Friedman's necessary condition. The number of extremal orders could be greater than one. If this occurs, then it may happen that Friedman's procedure gives a nonoptimal order as we illustrate by a numerical example. We derive a necessary condition that applies to unique extremal orders and a sufficient condition for an order to be optimal.

Keywords: 455; sequencing; in; one-against-many; battle (search for similar items in EconPapers)
Date: 1983
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.31.5.952 (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:31:y:1983:i:5:p:952-956

Access Statistics for this article

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