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

Bibliographische Detailangaben

1. Verfasser:	Omar, Amani
Format:	Other
Sprache:	Englisch
Veröffentlicht:	The Institute Of National Planning. 2018
Schlagworte:	Programming Economy Methodology
Online-Zugang:	http://repository.inp.edu.eg/handle/123456789/4040
Tags:	Tag hinzufügen Keine Tags, Fügen Sie das erste Tag hinzu!