(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.
Tallennettuna:
| Päätekijä: | |
|---|---|
| Aineistotyyppi: | Other |
| Kieli: | englanti |
| Julkaistu: |
The Institute Of National Planning.
2018
|
| Aiheet: | |
| Linkit: | http://repository.inp.edu.eg/handle/123456789/4040 |
| Tagit: |
Lisää tagi
Ei tageja, Lisää ensimmäinen tagi!
|
Lisää ensimmäinen kommentti!