Advertisement

Optimization Models

  • G. Isac
  • V. A. Bulavsky
  • V. V. Kalashnikov
Part of the Nonconvex Optimization and Its Applications book series (NOIA, volume 63)

Abstract

This section deals mainly with the problem of minimization of the function f : D → R over the closed convex subset K ⊂ D. The domain D ⊂ R n , in general, may not coincide with the whole space R n . However, in order to avoid considering the boundary effects, we will always assume that D is and open set. Thus, the closed subset K is contained in the interior of D. It is traditional to consider two classes of these problems: the case of continuously diffjerentiable function f and the case of convex function f.

Keywords

Lagrange Multiplier Variational Inequality Optimization Model Convex Function Linear Form 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arrow, K.J., Hurwicz, L., Uzawa, H. Studies in Linear and Nonlinear Programming. Stanford: Stanford University Press, 1958.Google Scholar
  2. Bulavsky, VA. 1.‘Feedback in Optimization Problems’. In: Proceedings of Institute of Mathematics of the USSR Academy of Sciences, Novosibirsk, 1988; 10: 55–63 (in Russian).Google Scholar
  3. Bulavsky, VA. 2. ‘Local Estimates and the Selection Problem’. In: Modern Mathematical Methods of Optimization, K.-H. Elster, ed., Berlin: Academic-Verlag, 1993.Google Scholar
  4. Bulavsky, VA. 3. Quasilinear programming and vector optimization. Soviet Math. Dokl. 1981; 23(2): 328–332.Google Scholar
  5. Clarke, F.H. Optimization and Non-Smooth Analysis. New York: Wiley Interscience, 1983.Google Scholar
  6. Cohon, J.L. Multiobjective Programming and Planning. New York — London: Academic Press, 1978.MATHGoogle Scholar
  7. Ekeland, I., and Temam, R. Convex Analysis and Variational Problems. New York: Academic Press, 1976.MATHGoogle Scholar
  8. Convex Cones, Sets, and Functions. Notes of Lectures at Princeton University, 1951.Google Scholar
  9. Keeney, R.L., Raiffa, H. Decisions with Multiple Objectives: Preferences and Value Tradeoffs. New York: Wiley, 1976.Google Scholar
  10. Kuhn, HW, Tucker, AW. ‘Nonlinear Programming’. In: Proceedings of the Secofid Berkeley Symposium on Mathematics, Statistics and Probability. Berkeley: University of California Press, 1951.Google Scholar
  11. Mangasarian, O.L. Nonlinear Programming. New York — London: McGraw-Hill, 1969.MATHGoogle Scholar
  12. Rockafellar, R.T. Convex Analysis. Princeton: Princeton University University, 1970.MATHGoogle Scholar
  13. Samuelson, P.A. Foundations of Economic Analysis. Harvard: Harvard University press, 1948.Google Scholar
  14. Zeleny, M. Linear Multiobjective Programming. New York-Berlin: Springer-Verlag, 1974.MATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2002

Authors and Affiliations

  • G. Isac
    • 1
  • V. A. Bulavsky
    • 2
  • V. V. Kalashnikov
    • 2
  1. 1.Department of Mathematics and Computer ScienceRoyal Military College of CanadaKingstonCanada
  2. 2.Central Economics Institute (CEMI) of Russian Academy of SciencesMoscowRussia

Personalised recommendations