A new solving procedure by m-M calculus for problems of constrained optimization
DOI:
https://doi.org/10.2298/YJOR0701001PKeywords:
constrained optimization, procedure, m-M CalculusAbstract
In this paper we state two procedures for constrained optimization based on the concepts of m-M Calculus. The first procedure is called basic and the second is called quick solving procedure. The quick solving procedure is very effective. It can also be applied to problems of unconstrained optimization. .References
Prešić, S.B. (1996) m-M Calculus. Beograd: Matematički institut SANU
Prešić, S.B. (1997) m-M Calculus. Beograd: Matematički institut SANU, Revised Edition
Prešić, S.B. (1998) A survey of the m-m calculus. Yugoslav Journal of Operations Research, vol. 8, br. 1, str. 137-168
Downloads
Published
2007-03-01
Issue
Section
Research Articles
License
Copyright (c) YUJOR
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.