Skip to main content
SpringerLink
Log in

Implementing stability results in solving large scale convex programming problems

  • Decomposition And Games
  • Conference paper
  • First Online:
Analysis and Optimization of Systems

Part of the book series: Lecture Notes in Control and Information Sciences ((LNCIS,volume 111))

  • 2005 Accesses

Abstract

The problem of handling large scale nonlinear programming problems is discussed. LSUMT. Vl is a modification for the well-known SUMT package, for solving nonlinear programming problems, to be adapted for solving large scale convex programs using pricing mechanism coordination. In this paper some stability notions, and related qualitative and quantitative analysis results are implemented to achieve some improvement in LSUMT. Vl algorithm. Comments are given on how to assemble a code for the proposed modified LSUMT algorithm. An illustrative example, to show the resulting savings in computation, is presented.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G.P. McCormic, "Large Scale Nonlinear Programming", Proceedings of First Conference on Operations Research and its Military Applications, Military Technical College (M.T.C.), Cairo, Egypt, Nov. 17–19, 1984.

    Google Scholar 

  2. L.S. Lasdon, "Optimization Theory for Large Systems", Macmillan Publishing Co., New York, 1970.

    Google Scholar 

  3. M.G. Singh and A. Titli, "Systems: Decomposition, Optimization and Control", Pergamon Press, Great Britain, 1978.

    Google Scholar 

  4. M.S.A Osman, A.K. El-Ariny, and T.H.M. Refaat, "An Algorithm for Decomposition Coordination of Large Scale Convex Programming Problems", Accepted for puplication in Computer and Operations Research, 1988.

    Google Scholar 

  5. W.C. Mylander, R.L. Holmes, and G.P. McCormick, "A Guide to SUMT Version 4: The Computer Programming Implementing The Sequential Unconstrained Minimization Techniques For Nonlinear Programming", Technical Paper RAC-p-68, Research Analysis Corporation, Mclean, Virginia, 1971

    Google Scholar 

  6. T.H.M. Refaat, and A.K. EL Ariny, "A Modified SUMT Algorithm for Solving Large Scale Convex Programming Problems", Proceedings of the Second Conference on Operations Research and its Military Applications Military Technical College (M.T.C.), Cairo, Egypt, Nov. 17–19, 1987.

    Google Scholar 

  7. M.S.A. Osman, "Qualitative Analysis of Basic Notions in Parametric Convex Programming II: Parameters in the Objective Function", Aplikatca Mathematiky, Prague, 1977.

    Google Scholar 

  8. M.S.A. Osman, and M.R. EL-Hefni, "Determination of the Stability Sets in Parametric Convex Programming Problems", Proceedings of the Second Conference on Operations Research and its Military Applications, Military Technical College (M.T.C), Cairo, Egypt, Nov. 17–19, 1987.

    Google Scholar 

  9. M. Balinski, "An Algorithm for Finding All Vertices of Convex Polyhedral Sets", Journal of the Society of Industrial and Applied Mathematics, pp 72–88, 1961.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dep. Military Technical College (M.T.C.), Cairo, Egypt

    M. S. A. Osman (Professor, Head of Computer and Operations Research (OR)

  2. (OR) Center, Ministry of Defense (M.O.D.), Cairo, Egypt

    M. R. El-Hefny

  3. Medical Services Department, M.O.D., Cairo, Egypt

    A. K. H. El-Ariny

Authors
  1. M. S. A. Osman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. R. El-Hefny
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. K. H. El-Ariny
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

A. Bensoussan J. L. Lions

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag

About this paper

Cite this paper

Osman, M.S.A., El-Hefny, M.R., El-Ariny, A.K.H. (1988). Implementing stability results in solving large scale convex programming problems. In: Bensoussan, A., Lions, J.L. (eds) Analysis and Optimization of Systems. Lecture Notes in Control and Information Sciences, vol 111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0042243

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19237-4

  • Online ISBN: 978-3-540-39161-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation