IDEAS home Printed from https://ideas.repec.org/a/wly/navlog/v30y1983i1p113-131.html
   My bibliography  Save this article

“simple‐approximate” battle‐outcome‐prediction conditions for variable‐coefficient lanchester‐type equations of modern warfare

Author

Listed:
  • James G. Taylor

Abstract

This article considers combat between two homogeneous forces modeled by variable‐ coefficient Lanchester‐type equations of modern warfare and develops new “simple‐approximate” battle‐outcome‐prediction conditions for military engagements terminated by two different types of prescribed conditions being met (fixed‐force‐level‐breakpoint battles and fixed‐force‐ratio‐breakpoint battles). These battle‐outcome‐prediction conditions are sufficient (but not necessary) to determine the outcome of battle without having to explicitly compute the force‐level trajectories, and they are characterized by their simplicity, requiring no advanced mathematical knowledge or tabulations of “special functions” for their application. Integrability properties of the Lanchester attrition‐rate coefficients figure prominently in their results, and involved in their development is a generalization of Lanchester's famous square law to variable‐coefficient Lanchester‐type combat and several other novel mathematical developments for the analysis of ordinary differential equations. Examples are given, with the attack of a mobile force against a static defensive position (both sides armed with weapons whose firepower is range dependent) being examined in detail.

Suggested Citation

  • James G. Taylor, 1983. "“simple‐approximate” battle‐outcome‐prediction conditions for variable‐coefficient lanchester‐type equations of modern warfare," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 30(1), pages 113-131, March.
  • Handle: RePEc:wly:navlog:v:30:y:1983:i:1:p:113-131
    DOI: 10.1002/nav.3800300109
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800300109
    Download Restriction: no

    File URL: https://libkey.io/10.1002/nav.3800300109?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:navlog:v:30:y:1983:i:1:p:113-131. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1931-9193 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.