A new solving procedure by m-M calculus for problems of constrained optimization

Authors

  • Slaviša Prešić Faculty of Mathematics, Belgrade

DOI:

https://doi.org/10.2298/YJOR0701001P

Keywords:

constrained optimization, procedure, m-M Calculus

Abstract

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., m-M Calculus, Mathematical Institute, Belgrade, 1996. (in Serbian)

Prešić, S.B., m-M Calculus, Revised Edition, Mathematical Institute, Belgrade, 1997. (in Serbian)

Prešić, S.B., "A survey of the m-M Calculus", Yugoslav Journal of Operations Research, 8(1) (1998) 137-168.

Downloads

Published

2007-03-01

Issue

Vol. 17 No. 1 (2007)

Section

Research Articles

License

Copyright (c) 2007 YUJOR

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.