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.
Sábháilte in:
| Príomhchruthaitheoir: | |
|---|---|
| Formáid: | Other |
| Teanga: | Béarla |
| Foilsithe / Cruthaithe: |
The Institute Of National Planning.
2018
|
| Ábhair: | |
| Rochtain ar líne: | http://repository.inp.edu.eg/xmlui/handle/123456789/4040 |
| Clibeanna: |
Cuir clib leis
Níl clibeanna ann, Bí ar an gcéad duine le clib a chur leis an taifead seo!
|