A New Solving Procedure by m-M Calculus for Problems of Constrained Optimization
Yugoslav journal of operations research, Tome 17 (2007) no. 1, p. 1
Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
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.
@article{YJOR_2007_17_1_a0,
author = {Slavi\v{s}a Pre\v{s}i\'c},
title = {A {New} {Solving} {Procedure} by {m-M} {Calculus} for {Problems} of {Constrained} {Optimization}},
journal = {Yugoslav journal of operations research},
pages = {1 },
year = {2007},
volume = {17},
number = {1},
zbl = {1150.90015},
language = {en},
url = {http://geodesic.mathdoc.fr/item/YJOR_2007_17_1_a0/}
}
Slaviša Prešić. A New Solving Procedure by m-M Calculus for Problems of Constrained Optimization. Yugoslav journal of operations research, Tome 17 (2007) no. 1, p. 1 . http://geodesic.mathdoc.fr/item/YJOR_2007_17_1_a0/