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

On the treatment of force‐level constraints in times‐equential combat problems

Author

Listed:
  • James G. Taylor

Abstract

The treatment of force‐level constraints in time‐sequential combat optimization problems is illustrated by further studying the fire‐programming problem of Isbell and Marlow. By using the theory of state variable inequality constraints from modern optimal control theory, sharper results are obtained on necessary conditions of optimality for an optimal fire‐distribution policy (in several cases justifying conjectures made in previous analysis). This leads to simplification of the determination of the domains of controllability for extremals leading to the various terminal states of combat. (Additionally, some new results for the determination of boundary conditions for the adjoint variables in optimal control problems with state variable inequality constraints have arisen from this work.) Some further extensions of previous analysis of the fire‐programming problem are also given. These clarify some key points in the solution synthesis. Some important military principles for target selection and the valuation of combat resources are deduced from the solution. As a result of this work, more general time‐sequential combat optimization problems can be handled, and a more systematic solution procedure is developed.

Suggested Citation

  • James G. Taylor, 1975. "On the treatment of force‐level constraints in times‐equential combat problems," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 22(4), pages 617-650, December.
  • Handle: RePEc:wly:navlog:v:22:y:1975:i:4:p:617-650
    DOI: 10.1002/nav.3800220402
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1002/nav.3800220402?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:22:y:1975:i:4:p:617-650. 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.