Title

The Lanchester (n, 1) problem

Authors

Authors

G. T. Kaup; D. J. Kaup;N. M. Finkelstein

Comments

Authors: contact us about adding a copy of your work at STARS@ucf.edu

Abbreviated Journal Title

J. Oper. Res. Soc.

Keywords

Lanchester problem; optimisation; SQUARE-LAW; Management; Operations Research & Management Science

Abstract

We discuss the background of the Lanchcster (n, 1) problem, in which a heterogeneous force of n different troop types Faces a homogeneous force. We also present a more general set of equations For modelling this problem, along with its general solution. As an example of the consequences of this model, we take the (2, 1) case and solve for the optimal force allocation and fire distribution in a (2, 1) battle. Next, we present examples that demonstrate our model's advantages over a previous formulation. In particular, we point out how different forces may will a battle, depending oil the handling and interpretation of the model's Solution. Lastly, we present a variant of the Lanchester square law which applies to the (2, 1) case.

Journal Title

Journal of the Operational Research Society

Volume

56

Issue/Number

12

Publication Date

1-1-2005

Document Type

Article

Language

English

First Page

1399

Last Page

1407

WOS Identifier

WOS:000233637800007

ISSN

0160-5682

Share

COinS