(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.
Uloženo v:
| Hlavní autor: | |
|---|---|
| Médium: | Other |
| Jazyk: | angličtina |
| Vydáno: |
The Institute Of National Planning.
2018
|
| Témata: | |
| On-line přístup: | http://repository.inp.edu.eg/handle/123456789/4040 |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | 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. |
|---|