IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v14y1966i2p267-278.html
   My bibliography  Save this article

A Class of Variational Problems in Search Theory and the Maximum Principle

Author

Listed:
  • E. J. Beltrami

    (Grumman Aircraft Engineering Corp., Bethpage, New York)

  • R. McGill

    (Grumman Aircraft Engineering Corp., Bethpage, New York)

Abstract

In this paper we consider certain nonlinear and constrained variational problems that occur in the theory of search. The problems are definitely of a nonclassical variety, but, by using a device of R. Courant, a sequence of unconstrained variational problems is generated, the solutions of which converge to the solution of the constrained problem. The maximum principle of L. Pontryagin et al., is then utilized to construct a corresponding sequence of nonlinear, two-point boundary value problems such that a solution to the variational problem will then necessarily satisfy the boundary value problem. An effective computational method, based on the notion of a generalized Newton-Raphson operator, is then applied to solve iteratively, in a rapid and accurate manner, the nonlinear boundary value problem; under suitable assumptions, this method yields solutions to the variational problem. The technique is illustrated in several examples.

Suggested Citation

  • E. J. Beltrami & R. McGill, 1966. "A Class of Variational Problems in Search Theory and the Maximum Principle," Operations Research, INFORMS, vol. 14(2), pages 267-278, April.
    • Handle: RePEc:inm:oropre:v:14:y:1966:i:2:p:267-278
    DOI: 10.1287/opre.14.2.267
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.14.2.267
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.14.2.267?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:inm:oropre:v:14:y:1966:i:2:p:267-278. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.