Skip to main content
SpringerLink
Log in

EMP: An Expert System for Mathematical Programming

  • Conference paper
Optimization, Parallel Processing and Applications

Part of the book series: Lecture Notes in Economics and Mathematical Systems ((LNE,volume 304))

  • 457 Accesses

Abstract

The paper describes a software system that supports model building and numerical solution of various mathematical programming problems, e.g. of nonlinear programming, data fitting, min-max programming, multicriteria optimization, nonsmooth optimization, quadratic programming, or linear programming, subject to linear or nonlinear constraints. All actions of the system are controlled by menues which inform the user how to generate, solve, edit, delete or list a problem, for example. Nonlinear problem functions must be defined by sequences of FORTRAN statements assigning a numerical value to a user-provided name. The system writes a complete FORTRAN source program, which is linked and executed automatically. All problem data and numerical results are stored in a data base and are easily retrieved for further processing. For each nonlinear problem, at least two different mathematical algorithms are available. The system is capable to learn, i.e. to improve its own knowledge on the success of the algorithms, and to perform a rule-based error analysis in case of nonsuccessful termination.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Brown, K.M., Dennis, J.E. (1972): Derivative free analogues of the Levenberg-Marquardt and Gauss-Newton algorithms for nonlinear least squares approximations, Numerische Mathematik, Vol. 18, 289–297.

    Article  Google Scholar 

  • Ecker, J.G., Kupferschmid, M. (1983): An ellipsoid algorithm for nonlinear programming, Mathematical Programming, Vol. 27, 83–106.

    Article  Google Scholar 

  • Fletcher, R. (1972): Fortran subroutines for minimization by quasi-Newton methods, Report R7125 AERE, Harwell, England.

    Google Scholar 

  • Goldfarb, D., Idnani, A. (1983): A numerically stable dual method for solving strictly convex quadratic programs, Mathematical Programming, Vol. 27, 1–33.

    Article  Google Scholar 

  • Gill, P.E., Murray, W., Saunders, M.A., Wright, M.H. (1983a): User’s guide for SOL/NPSOL: a FORTRAN package for nonlinear programming, Report SOL 83–12, Department of Operations Research, Stanford University, USA.

    Google Scholar 

  • Gill, P.E., Murray, W., Saunders, M.A., Wright, M.H. (1983b): User’s guide for SOL/QPSOL: a FORTRAN package for quadratic programming, Report SOL 83–7, Department of Operations Research, Stanford University, USA.

    Google Scholar 

  • Han, S.-P. (1976): Superlinearly convergent variable metric algorithms for general nonlinear programming problems, Mathematical Programming, Vol. 11, 263–282.

    Article  Google Scholar 

  • Han, S.-P. (1977): A globally convergent method for nonlinear programming, Journal of Optimization Theory and Applications, Vol. 22, 297–309.

    Article  Google Scholar 

  • Hock, W., Schittkowski, K. (1981): Test examples for nonlinear programming codes, Lecture Notes in Economics and Mathematical Systems, Vol. 187, Springer, Berlin, Heidelberg, New York.

    Google Scholar 

  • Hock, W., Schittkowski, K. (1983): A comparative performance evaluation of 27 nonlinear programming codes, Computing, Vol. 30, 335–358.

    Article  Google Scholar 

  • Lemarechal, C., Strodiot, J.-J., Bihain, A. (1981): On a bundle algorithm for nonsmooth optimization, in: Mangasarian, O.L., Meyer, R.R., Robinson, S.M.: Nonlinear programming, Academic Press.

    Google Scholar 

  • Lindstroem, P. (1983): Akgorthms for nonlinear least squares particularly problems with constraints, Report UMINF - 106. 83, Institute of Information Processing, University of Umea, Sweden.

    Google Scholar 

  • Powell, M.J.D. (1978a): A fast algorithm for nonlinearly constrained optimization calculations, in: Numerical Analysis, G.A. Watson ed., Lecture Notes in Mathematics, Vol. 630, Springer, Berlin, Heidelberg, New York.

    Google Scholar 

  • Powell, M.J.D. (1978b): The convergence of variable metric methods for nonlinearly constrained optimization calculations, in: Nonlinear Programming 3, O.L. Mangasarian, R.R Meyer, S.M. Robinson eds., Academic Press, New York, San Francisco, London.

    Google Scholar 

  • Powell, M.J.D. (1983): On the quadratic programming algorithm of Goldfarb and Idnani, Report DAMTP 1983/Na 19, University of Cambridge, Cambridge, Great Britain.

    Google Scholar 

  • Schittkowski, K. (1980): Nonlinear programming codes, Lecture Notes in Economics and Mathematical Systems, Vol. 183, Springer, Berlin, Heidelberg, New York.

    Google Scholar 

  • Schittkowski, K. (1983): On the convergence of a sequential quadratic programming method with an augmented Lagrangian line search function, Mathematische Operationsforschung and Statistik, Series Optimization, Vol. 14, 197–216.

    Google Scholar 

  • Schittkowski, K. (1985): Solving constrained nonlinear least squares problems by a general purpose SQP-method, Report, Mathematisches Institut, Universitaet Bayreuth, 8580 Bayreuth.

    Google Scholar 

  • Schittkowski, K. (1985/86): NLPQL: A FORTRAN subroutine solving constrained nonlinear programming problems, Annals of Operations Research, Vol. 5; 485–500.

    Google Scholar 

  • Schittkowski, K. (1986a): ELL: A FORTRAN implementation of an ellipsoid algorithm for nonlinear programming, User’s Guide, Mathematisches Institut, Universitaet Bayreuth, 8580 Bayreuth.

    Google Scholar 

  • Schittkowski, K. (1986b): MCO: A FORTRAN implementation of an interactive multicriterion optimization method, User’s Guide, Mathematisches Institut, Universitaet Bayreuth, 8580 Bayreuth.

    Google Scholar 

  • Schittkowski, K. (1986c): DFNLP: A FORTRAN implementation of an SQP-algorithm for constrained nonlinear data fitting and min-max problems, User’s Guide, Mathematisches Institut, Universitaet Bayreuth, 8580 Bayreuth.

    Google Scholar 

  • Schittkowski, K. (1986d): DFELL: A FORTRAN implementation of an ellipsoid algorithm for nonlinear data fitting, User’s Guide, Mathematisches Institut, Universitaet Bayreuth, 8580 Bayreuth.

    Google Scholar 

  • Schittkowski, K. (1986e): QL: A FORTRAN implementation of a dual algorithm for quadratic programming, User’s Guide, Mathematisches Institut, Universitaet Bayreuth, 8580 Bayreuth.

    Google Scholar 

  • Schittkowski, K. (1986f): LP: A FORTRAN implementation of the simplex algorithm for linear programming, User’s Guide, Mathematisches Institut, Universitaet Bayreuth, 8580 Bayreuth.

    Google Scholar 

  • Schittkowski, K. (1987): Die Systementwicklungssprache SUSY, Report, Mathematisches Institut, Universitaet Bayreuth, 8580 Bayreuth.

    Google Scholar 

  • Shor, N.Z. (1977): Cut-off method with space extension in convex programming problems, Cybernetics, Vol. 12, 94–96.

    Google Scholar 

  • Wilson, R.B. (1963): A simplicial algorithm for concave programming, Ph.D. Thesis, Graduate School of Business Administration, Harward University, Boston, USA.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematisches Institut, Universitaet Bayreuth, D - 8700, Bayreuth, Germany

    Klaus Schittkowski

Authors
  1. Klaus Schittkowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. International Institute for Applied Systems Analysis (IIASA), Schloßplatz 1, A-2361, Laxenburg, Austria

    Alexander Kurzhanski

  2. Institute of Mathematics and Mechanics of the Ural Scientific Center of the Academy of Sciences of the USSR, Sverdlovsk, USSR

    Alexander Kurzhanski

  3. Institut für Wirtschaftstheorie und Operations Research, Universität Karlsruhe, Kaiserstr. 12, D-7500, Karlsruhe, Germany

    Klaus Neumann

  4. Institut für Statistik und Mathematische Wirtschaftstheorie, Universität Karlsruhe, Postfach 6980, D-7500, Karlsruhe 1, Germany

    Diethard Pallaschke

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schittkowski, K. (1988). EMP: An Expert System for Mathematical Programming. In: Kurzhanski, A., Neumann, K., Pallaschke, D. (eds) Optimization, Parallel Processing and Applications. Lecture Notes in Economics and Mathematical Systems, vol 304. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46631-1_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-46631-1_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19053-0

  • Online ISBN: 978-3-642-46631-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation