The Lanchester (n, 1) problem

DOI10.1057/PALGRAVE.JORS.2601936zbMATH Open1142.90443OpenAlexW1994899936MaRDI QIDQ3372532FDOQ3372532

Authors: G. T. Kaup, David J. Kaup, N. M. Finkelstein 

Publication date: 21 February 2006

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601936

Recommendations

• scientific article; zbMATH DE number 3852775
• Lanchester models for mixed forces with semi-dynamical target allocation
• The optimal policy for the one-against-many heterogeneous Lanchester model
• Lanchester model for three-way combat
• Solution of Lanchester equation models for combat

zbMATH Keywords

ModelingOptimal allocationFireLanchester warfare

Mathematics Subject Classification ID

Case-oriented studies in operations research (90B90) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Cited In (12)

• Lanchester model for three-way combat
• Spatial Lanchester models
• Targeting, deployment, and loss-tolerance in Lanchester engagements
• A Monte Carlo model of Lanchester's square law
• The Lanchester square-law model extended to a (2,2) conflict
• The battle of Gibeah: a further analysis
• Cost-efficiency analysis of weapon system portfolios
• Spatial attrition modeling: stability conditions for a FD formulation
• Title not available (Why is that?)
• The optimal policy for the one-against-many heterogeneous Lanchester model
• Optimal resource allocation and redistribution strategy in military conflicts with Lanchester square law attrition
• Modeling and optimal control of a class of warfare hybrid dynamic systems based on lanchester \((n, 1)\) attrition model

This page was built for publication: The Lanchester (n, 1) problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3372532)