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.
Na minha lista:
| Autor principal: | |
|---|---|
| Formato: | Other |
| Idioma: | inglês |
| Publicado em: |
The Institute Of National Planning.
2018
|
| Assuntos: | |
| Acesso em linha: | http://repository.inp.edu.eg/xmlui/handle/123456789/4040 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|