(1288) A method for local and global minimization of concave function under linear constraints طريقة للتقليل المحلي والعالمي للدالة المقعرة في ظل قيود خطية
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.
Shranjeno v:
| Glavni avtor: | |
|---|---|
| Format: | Other |
| Jezik: | angleščina |
| Izdano: |
The Institute Of National Planning.
2018
|
| Teme: | |
| Online dostop: | http://repository.inp.edu.eg/handle/123456789/4040 |
| Oznake: |
Označite
Brez oznak, prvi označite!
|
Komentirajte kot prvi!