A method for local and global minimization of concave function under linear consraints
| dc.contributor.author | Omar, Amani | |
| dc.date.accessioned | 2018-08-12T13:18:31Z | |
| dc.date.available | 2018-08-12T13:18:31Z | |
| dc.date.issued | 1981-02 | |
| dc.identifier.uri | http://repository.inp.edu.eg/xmlui/handle/123456789/4040 | |
| dc.description.abstract | 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. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | The Institute Of National Planning. | en_US |
| dc.relation.ispartofseries | External Notes.;1288 | |
| dc.subject | Programming | en_US |
| dc.subject | Economy | en_US |
| dc.subject | Methodology | en_US |
| dc.title | A method for local and global minimization of concave function under linear consraints | en_US |
| dc.type | Other | en_US |
