(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...
Guardat en:
| Autor principal: | |
|---|---|
| Format: | Other |
| Idioma: | anglès |
| Publicat: |
The Institute Of National Planning.
2018
|
| Matèries: | |
| Accés en línia: | http://repository.inp.edu.eg/handle/123456789/4025 |
| Etiquetes: |
Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|
| Sumari: | 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 convex. |
|---|