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.
Bewaard in:
| Hoofdauteur: | |
|---|---|
| Formaat: | Other |
| Taal: | Engels |
| Gepubliceerd in: |
The Institute Of National Planning.
2018
|
| Onderwerpen: | |
| Online toegang: | http://repository.inp.edu.eg/xmlui/handle/123456789/4040 |
| Tags: |
Voeg label toe
Geen labels, Wees de eerste die dit record labelt!
|