| Article ID: | iaor2009650 |
| Country: | Serbia |
| Volume: | 17 |
| Issue: | 1 |
| Start Page Number: | 1 |
| End Page Number: | 8 |
| Publication Date: | Jan 2007 |
| Journal: | Yugoslav Journal of Operations Research |
| Authors: | Preic Slavia |
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.