A Method for Local and Global Minimization of Concave Function under Linear Constraints
Last updated: 17 Dec 2024
A Method for Local and Global Minimization of Concave Function under Linear Constraints
Methodology
Economy
Programming
http://41.33.33.151/xmlui/handle/123456789/4040
Amani Omar
2018-08-12T13:18:31Z
2018-08-12T13:18:31Z
1
2023
02-1981
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.
22 p
paper
cairo
eng
The Institute Of National Planning.
سلسلة مذكرات خارجية رقم (1288)
book
2023
Details
Type
INP Report
Created At
24 Dec 2023