Skip to main content
Log in

Hybrid computation in mathematical programming

  • Published:
Mathematical Programming Submit manuscript

Abstract

It is shown that hybrid computation facilitates the solving of problems in the field of mathematical programming. First, the most important features of hybrid computation are discussed. The main part of the paper deals with examples of computational methods in which hybrid computation can be applied succesfully. The main concentration is on constrained static parameter optimization, where for brevity only penalty function techniques are considered. The use of a penalty function having an extra parameter is discussed rather extensively.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. G.A. Bekey, “Optimization of multiparameter systems by hybrid computer techniques”,Simulation 3 (2) (1964) 19–32; 3 (3) (1964) 21–29.

    Google Scholar 

  2. G.A. Bekey, “System identification — an introduction and a survey”,Simulation 15 (4) (1970) 151–166.

    Google Scholar 

  3. G.A. Bekey and W.J. Karplus,Hybrid computation (Wiley, New York, 1968).

    Google Scholar 

  4. L. Dekker, “Applicability of hybrid computation”, Survey paper in:Proceedings AICA—IFIP conference on Hybrid Computation, Munich, 1970 (Presses Academiques Européennes, Brussels, 1971).

    Google Scholar 

  5. L. Dekker and J.C. Zuidervaart, “Spline optimization method/optimizing the route of a road by hybrid computation”, in:Proceedings AICA—IFIP conference on Hybrid Computation, Munich, 1970 (Presses Academiques Européennes, Brussels, 1971).

    Google Scholar 

  6. L.E. Fogarty and R.M. Howe, “Trajectory optimization by a direct descent process”,Simulation 11 (3) (1968) 145–155.

    Google Scholar 

  7. E.G. Gilbert, “A selected bibliography of parameter optimization methods suitable for hybrid computation”,Simulation 8 (6) (1967) 350–352.

    Google Scholar 

  8. J. Kowalik and M.R. Osborne, “Method of Schmit and Fox”, in:Method for unconstrained optimization problems (American Elsevier, New York, 1968) 83–84.

    Google Scholar 

  9. F.A. Lootsma, “Boundary properties of penalty functions for constrained minimization”, Thesis, Technical University Eindhoven, The Netherlands (1970).

    Google Scholar 

  10. D.D. Morrison, “Optimization by least squares”,SIAM Journal of Numerical Analysis 5 (1) (1968) 83–88.

    Google Scholar 

  11. Proceedings AICA—IFIP conference on Hybrid Computation, Munich, 1970 (Presses Academiques Européennes, Brussels, 1971).

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dekker, L. Hybrid computation in mathematical programming. Mathematical Programming 4, 21–43 (1973). https://doi.org/10.1007/BF01584645

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01584645

Keywords

Navigation