(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.
Saved in:
| Main Author: | |
|---|---|
| Format: | Other |
| Language: | English |
| Published: |
The Institute Of National Planning.
2018
|
| Subjects: | |
| Online Access: | http://repository.inp.edu.eg/handle/123456789/4040 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|