A method for local and global minimization of concave function under linear consraints
Global optimization involves solving mathematical programming problems that may have distinct local optima. In this paper, I present a method for locating a global minimum (maximum) of a concave (convex) function subjected to linear inequalities.
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Other |
| 语言: | 英语 |
| 出版: |
The Institute Of National Planning.
2018
|
| 主题: | |
| 在线阅读: | http://repository.inp.edu.eg/xmlui/handle/123456789/4040 |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|
| 总结: | Global optimization involves solving mathematical programming problems that may have distinct local optima. In this paper, I present a method for locating a global minimum (maximum) of a concave (convex) function subjected to linear inequalities. |
|---|