The problem considered is as follows: given CRnC\subset \R^n and F:CRnF:C\rightarrow \R^n differentiable, find f:CRf:C\rightarrow \R differentiable such that f(x)1f(x)=F(x)1F(x)\norm \nabla f(x)\norm^{-1} \nabla f(x) = \norm F(x) \norm^{-1}F(x) for all xCx\in C. Conditions for ff to be pseudoconvex or convex are given. The results are applied to the differentiable case of the revealed preference problem.

Contact details are reproduced from the original publication and may be historical.

Tamás Rapcsák

Computer and Automation Institute, Hungarian Academy of Sciences, 1518 Budapest, Hungary

J.-P. Crouzeix, T. Rapcsák. “Integrability of Pseudomonotone Differentiable Maps and the Revealed Preference Problem.” Journal of Convex Analysis 12 (2005), No. 2, 431–446.