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

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. .

Keywords

• constrained optimization
• procedure
• m-M Calculus