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...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Other |
| 语言: | 英语 |
| 出版: |
The Institute Of National Planning.
2018
|
| 主题: | |
| 在线阅读: | http://repository.inp.edu.eg/xmlui/handle/123456789/4025 |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|
| 总结: | 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. |
|---|