Please use this identifier to cite or link to this item:
http://hdl.handle.net/20.500.11889/4031
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Aloqeili, Marwan | - |
dc.date.accessioned | 2017-01-05T07:39:32Z | - |
dc.date.available | 2017-01-05T07:39:32Z | - |
dc.date.issued | 2015-07 | - |
dc.identifier.uri | http://hdl.handle.net/20.500.11889/4031 | - |
dc.description.abstract | In this paper, we solve an inverse problem arising in convex optimization. We consider a maximization problem under m linear constraints. We characterize the solutions of this kind of problems. More precisely, we give necessary and sufficient conditions for a given function in Rn to be the solution of a multi-constraint maximization problem. The conditions we give here extend well-known results in microeconomic theory | en_US |
dc.language.iso | en | en_US |
dc.subject | Calculus of variations | en_US |
dc.subject | Differential equations | en_US |
dc.subject | Geometry, Differential | en_US |
dc.subject | Mathematical optimization | en_US |
dc.subject | Stochastic control theory | en_US |
dc.subject | Utility theory | en_US |
dc.title | The inverse problem in convex optimization with linear constraints | en_US |
dc.type | Article | en_US |
newfileds.department | Science | en_US |
newfileds.item-access-type | open_access | en_US |
newfileds.thesis-prog | none | en_US |
newfileds.general-subject | none | en_US |
item.fulltext | With Fulltext | - |
item.languageiso639-1 | other | - |
item.grantfulltext | open | - |
Appears in Collections: | Fulltext Publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
inverseproblemv2.pdf | 231.45 kB | Adobe PDF | View/Open |
Page view(s)
129
Last Week
0
0
Last month
2
2
checked on Apr 14, 2024
Download(s)
46
checked on Apr 14, 2024
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.