Title

The Lanchester (N, 1) Problem

Keywords

Lanchester problem; Optimisation

Abstract

We discuss the background of the Lanchester (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 win a battle, depending on 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. © 2005 Operational Reasearch Society Ltd. All rihgts reserved.

Publication Date

1-1-2005

Publication Title

Journal of the Operational Research Society

Volume

56

Issue

12

Number of Pages

1399-1407

Document Type

Article; Proceedings Paper

Personal Identifier

scopus

DOI Link

https://doi.org/10.1057/palgrave.jors.2601936

Socpus ID

27844575242 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/27844575242

This document is currently not available here.

Share

COinS