IDEAS home Printed from
   My bibliography  Save this article

A Network Model to Maximize Navy Personnel Readiness and Its Solution


  • Iosif A. Krass

    (Navy Personnel Research and Development Center, San Diego, California 92152-6800)

  • Mustafa Ç. Pinar

    (The Institute for Numerical Analysis, The Technical University of Denmark, 2800 Lyngby, Denmark)

  • Theodore J. Thompson

    (Navy Personnel Research and Development Center, San Diego, California 92152-6800)

  • Stavros A. Zenios

    (Decision Sciences Department, University of Pennsylvania, Philadelphia, Pennsylvania 19104)


The problem of optimally (re)allocating Navy personnel to combat units is compounded by several considerations: availability of trained personnel, staffing of positions by occupation groups or ranks, and maintaining an acceptable level of readiness. In this paper we model this problem as a nonlinear nondifferentiable optimization problem. A reformulation of the nonlinear optimization problem as a network flow problem is then developed. The formulation results in a network flow problem with side constraints. An additional, nonnetwork, variable measures the readiness level. This new formulation permits the use of network optimization tools in order to solve effectively very large problems. We then develop two numerical methods for solving this problem. One method is based on a heuristic that solves (approximately) the nondifferentiable problem. The second method is based on a Linear-Quadratic Penalty (LQP) algorithm, and it exploits the embedded network structure by placing the side constraints into the objective function. The resulting nonlinear network program is solved using a simplicial decomposition of the network constraint set. Numerical results indicate the viability of this approach on problems with up to 36,000 arcs and 17,000 nodes with 3,700 side constraints.

Suggested Citation

  • Iosif A. Krass & Mustafa Ç. Pinar & Theodore J. Thompson & Stavros A. Zenios, 1994. "A Network Model to Maximize Navy Personnel Readiness and Its Solution," Management Science, INFORMS, vol. 40(5), pages 647-661, May.
  • Handle: RePEc:inm:ormnsc:v:40:y:1994:i:5:p:647-661
    DOI: 10.1287/mnsc.40.5.647

    Download full text from publisher

    File URL:
    Download Restriction: no


    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.

    Cited by:

    1. Dan Shrimpton & Alexandra M. Newman, 2005. "The US Army Uses a Network Optimization Model to Designate Career Fields for Officers," Interfaces, INFORMS, vol. 35(3), pages 230-237, June.
    2. Armacost, Andrew P. & Lowe, James K., 2005. "Decision support for the career field selection process at the US Air Force Academy," European Journal of Operational Research, Elsevier, vol. 160(3), pages 839-850, February.


    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:inm:ormnsc:v:40:y:1994:i:5:p:647-661. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Matthew Walls). General contact details of provider: .

    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 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.