Volume 23, Number 1, January-March 2017
|Page(s)||71 - 94|
|Published online||10 October 2016|
The inverse problem in convex optimization with linear constraints∗,∗∗
Department of Mathematics, Birzeit
University, P.O. Box
Revised: 22 June 2015
Accepted: 21 July 2015
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.
Mathematics Subject Classification: 90C45 / 49N45
Key words: Inverse problem / multi-constraint maximization / value function / Slutsky relations
© EDP Sciences, SMAI 2016
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.