(1291) A programming method for Quasi and explicitly Quasi-concave minimum programming problem طريقة برمجة لمسألة البرمجة الدنيا شبه المقعرة وشبه المقعرة الصريحة

In the fifties, the theory of nonlinear programming was almost limited to problems in which the consraints and the objective functions were convex. In the sixties, it was gradually recognized that for most of the theorems to hold and for many of the methods to work, only some weaker property of conv...

Descrición completa

Gardado en:
Detalles Bibliográficos
Autor Principal: Omar, Amani
Formato: Other
Idioma:inglés
Publicado: The Institute Of National Planning. 2018
Subjects:
Acceso en liña:http://repository.inp.edu.eg/handle/123456789/4025
Tags: Engadir etiqueta
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!