Skip to main content

Consistent Aggregation in Parametric Optimization

  • Chapter
  • 253 Accesses

Part of the book series: Applied Optimization ((APOP,volume 83))

Abstract

Many applied optimization problems require analyzing the effect of changes in problems’ data (parameters) on optimal function values. For example, this is the case when parameters vary over a given set, and optimization should be performed not only with respect to the original decision variables but also with respect to the parameters. The situation becomes even more complicated when the set of admissible parameters is corrected in the course of optimization.

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

Buying options

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
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References to Chapter 3

  1. Alexeev V.M., Tikhomirov V.M. and Fomin S.V., Optimal’noe upravlenie (Optimal Control), Moscow: Nauka, 1979.

    Google Scholar 

  2. Chvatal V., Edmonds Polytopes and a Hierarchy of Combinatorial Problems, Discrete Mathematics, 1973, vol. 4, no 4, pp. 305–337.

    Article  MathSciNet  MATH  Google Scholar 

  3. Demianov V.F. and Malozemov V.N., Vvedenie v minimax (Introduction to Minimax), Moscow: Nauka, 1972.

    Google Scholar 

  4. Gal T., Postoptimal Analysis, Parametric Programming and Related Topics, New York: McGraw Hill, 1979.

    Google Scholar 

  5. Eremin I.I. and Astafiev I.N., Vvedenie v teoriyu lineinogo i vypuklogo programmirovaniya (Introduction in Linear and Convex Programming Theory), Moscow: Nauka, 1976.

    Google Scholar 

  6. Fiacco A.V., McCormick G.P., Nonlinear Programming: Sequential Unconstrained Minimization Techniques, Chichester, England: Wiley, 1968.

    Google Scholar 

  7. Finkel’shtein Yu.Yu., Algoritmy resheniya zadachi parametricheskogo programmirovaniya dlia slychaiya, kogda A-matritsa zavisit ot parametra (Parametric Programming Algorithms for the Case of A-Matrix Depending on a Parameter), Econ Mat. Metody, 1977, vol.13, no. 2, pp. 342–347.

    Google Scholar 

  8. Gantmaher F.R., The Theory of Matrices, New York: Chelsea, 1959.

    Google Scholar 

  9. Hu T.C., Integer Programming and Network Flows, New York: Addison-Wesley, 1969.

    Google Scholar 

  10. Iliutovich A.E. and Levitin E.S., Metody decompositsii zadach optimal’nogo upravleniya so smeshannymi reguliarnymi ogranicheniymi i so svobodnym kontsom traektorii (Decomposition Methods for Optimal Control Problems with Mixed Regular Constraints and without Terminal Restrictions), Preprint VNIISI, Moscow, 1987.

    Google Scholar 

  11. Ioffe A.D. and Tikhomirov V.M., Teoriya extremal’ nykh zadatch (Theory of Extremal Problems), Moscow: Nauka, 1974.

    Google Scholar 

  12. Karmanov V.G., Matematicheskoe programmirovaniye (Mathematical Programming), Moscow: Nauka, 1980.

    Google Scholar 

  13. Krysov Yu.A., O sovmestnom agregirovanii v nekotoryh classakh parametricheskikh optimizatsionnykh zadach v banakhovom prostranstve (On Consistent Aggregation in Some Classes of Parametric Optimizations Problems in Banach Space), Avtom. Telemekh., 1987, no.12, pp. 147–157.

    Google Scholar 

  14. Krysov Yu.A., O sovmestnosti i ystoichivosti agregirovaniya v parametricheskikh zadachakh matematicheskogo programmirovaniya (On Consistency and Stability of Aggregation in Parametric Mathematical Programming Problems), Zh. Vych. Mat. Mat. Fiz., 1988, vol. 28, no. 12, pp. 1789–1798.

    Google Scholar 

  15. Krysov, Yu. A., Approksimatsiya optima’nogo znacheniya v parametricheskikh optimizatsionnykh protsedurakh (Approximation of the Optimum Function in Parametric Optimization Procedures), Avtom. Telemekh., 1992, no. 12, pp. 106–114.

    Google Scholar 

  16. Krysov, Yu. A., Prinyatie i coordinatsiya reshenii v nekotorykh protsedurakh parametricheskogo analiza optimizatsionnykh zadach (Making and Coordinating Decisions in Certain Procedures of Parametric Analysis in Optimization Problems), Izv. Akad. Nauk SSSR. Tekhn. Kibernet., 1990, no. 6, pp. 43–57.

    Google Scholar 

  17. Krysov, Yu. A. Optimizatsiya parametricheskikh sistem na osnove agregirovaniya upravlenii (Optimization of Parametric Systems Based on Aggregation of Controls), Izv. Akad. Nauk SSSR. Tekhn. Kibernet, 1990, no. 3, pp. 50–56.

    Google Scholar 

  18. Kyparisis J., On Uniqueness of Kuhn-Tucker Multipliers in Nonlinear Programming, Math. Progr., 1985, vol. 32, pp. 242–246.

    Google Scholar 

  19. Lankaster K., Matematicheskaia economica (Mathematical Economics), Moscow: Sovietskoe Radio, 1972.

    Google Scholar 

  20. Lasdon L.S., Optimization Theory for Large Systems, London: McMillan, 1970.

    Google Scholar 

  21. Leontiev V.K., Ustoichivost’ v kombinatornykh zadachakh vybora (Stability in Combinatorial Problems of Choice), Dokl. Acad. Nauk SSSR, 1976, vol. 228, nol, pp. 23–25.

    Google Scholar 

  22. Markus M. and Mink X., A Survey of Matrix Theory and Matrix Inequalities, Prindle: Weber and Schmidt, 1964.

    Google Scholar 

  23. Mordukhovich B.S., Metody approximatsii v zadachakh optimizatsii i upravleniya (Approximation Methods in Problems of Optimization and Control), Moscow: Nauka, 1988.

    Google Scholar 

  24. Murtagh B.A., Advanced Linear Programming, New York: McGraw-Hill, 1981.

    Google Scholar 

  25. Nemhauser G.L. and Wolsey L.A., Integer and Combinatorial Optimization, New York: Wiley; 1988.

    Google Scholar 

  26. Papadimitriou C.H. and Stieglitz K., Combinatorial Optimization: Algorithms and Complexity, Englewood Cliffs: Prentice-Hall, 1982.

    Google Scholar 

  27. Pshenichnyi B.N., Metod linearizatsii (Linearization Method), Moscow: Nauka, 1983.

    Google Scholar 

  28. Shapiro A. and Bonnans.J.F., Perturbation Analysis of Optimization Problems, New York: Springer, 1999.

    Google Scholar 

  29. Tewarson R.P., Sparce Matrices, New York: Academic Press, 1973.

    Google Scholar 

  30. Tsurkov V.I., Dinamitcheskie zadachi bol’shoi razmernosti (Large-Scale Dynamical Problems), Moscow: Nauka, 1988.

    Google Scholar 

  31. Tsurkov V.I., Ven V.L., Krysov Yu.A. and Litvinchev I.S., Metody decompozitsii i agregirovaniya v mnogomernykh zadachakh optimizatsii (Decomposition and Aggregation Methods in Multidimensional Optimization Problems), in Probl Prikl. Mat. Informat Part 2, 1992, pp. 65–88, Moscow: Comp. Ctr. Russ. Acad. Scis.

    Google Scholar 

  32. Yudin D.B. and Gol’shtein E.G., Lineinoe programmirovanie. Teoriya, metody i prilozjeniya (Linear Programming: Theory, Methods and Applications), Moscow: Nauka, 1969.

    Google Scholar 

  33. Ven V.L., Chastichnoe agregirovanie v zadachakh tselochislennogo lineinogo programmirovaniya s var’iryemymi parametrami (Partial Aggregation in Parametric Integer Linear Programming), Econ. Mat. Metody, 1985, vol. 21, no. 3, pp. 501–510.

    Google Scholar 

  34. Ven V.L. and Krysov Yu.P., Chastichnoe agregirovanie v zadachakh lineinogo programmirovaniya s var’ iryemymi parametrami (Partial Aggregation in Parametric Linear Programming Problems), Izv. Akad. Nauk SSSR. Tekhn. Kibernet, 1983, no. 3, pp. 3–10.

    Google Scholar 

  35. Ven, V. L. and Krysov, Yu. A., Agregirovanie i approximatsiya v zadachakh parametricheskogo programmirovaniya (Aggregation and Approximation in Problems of Parametric Programming), Dokl. Akad. Nauk SSSR, 1990, vol. 311, no. 6, pp. 1289–1292.

    Google Scholar 

  36. Zangwill W.I., Nonlinear Programming, Englewood Cliffs: Prentice Hall, 1969.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Litvinchev, I., Tsurkov, V. (2003). Consistent Aggregation in Parametric Optimization. In: Aggregation in Large-Scale Optimization. Applied Optimization, vol 83. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-9154-6_3

Download citation

  • DOI: https://doi.org/10.1007/978-1-4419-9154-6_3

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-4812-2

  • Online ISBN: 978-1-4419-9154-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics