(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.

Ngā taipitopito rārangi puna kōrero

Kaituhi matua:	Omar, Amani
Hōputu:	Other
Reo:	Ingarihi
I whakaputaina:	The Institute Of National Planning. 2018
Ngā marau:	Programming Economy Methodology
Urunga tuihono:	http://repository.inp.edu.eg/handle/123456789/4040
Ngā Tūtohu:	Tāpirihia he Tūtohu Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!