Skip to main content
Log in

A Generalization of the Expenditure Function

  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

We consider a generalized expenditure function and the corresponding Hicksian demand. First, we provide some economic interpretation of the problem at stake. Then, we obtain different properties of the solution: existence, Lipschitz behavior and differential properties. Finally, we provide a Slutsky-type property.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Notes

  1. In the paper, we use the following notations:

    • \(x\ge y\) means: \(x_{h}\ge y_{h}\) for all \(h=1,\ldots ,\ell \).

    • \(x\gg y\) means: \(x_{h}>y_{h}\) for all \(h=1,\ldots ,\ell \).

    • \(e_{h}\) denotes the h-th vector of the canonical basis of \({\mathbb {R}}^{\ell }\).

    • \(\mathbf {1}_{\ell }\) denotes the \(\ell \)-dimensional vector whose coordinates are all equal to one. Similarly, \(\mathbf {1}_{n}\) denotes the n-dimensional vector whose coordinates are all equal to one. When there is no confusion, we simply write \(\mathbf {1}\).

    • Let \(v \in {\mathbb {R}}^{\ell }. \Vert v\Vert :=\sum _{h=1}^{\ell }|v_{h}|\) denotes the norm of the vector v.

  2. Take \(x:=\left( \dfrac{1}{4},\dfrac{1}{4}\right) \) and \(\left( x^{\nu }:=\left( 1+\dfrac{1}{\nu },\dfrac{1}{\nu }\right) \right) _{\nu \ge 1}\) as a counterexample.

  3. For the sake of completeness, this is proved in “Appendix.”

  4. A presentation of the expenditure minimization problem can be found in any intermediary or advanced microeconomics textbook. For the sake of completeness, we refer the reader to [9].

  5. A good is considered public if its use by one agent does not prevent other agents from using it[...]. (Laffont[10])

  6. Recall the definition in [9]: An externality is present whenever the well-being of a consumer or the production possibilities of a firm are directly affected by the actions of another agent in the economy. Many economic goods can be considered as positive externalities such as vaccination or network.

  7. The first scalar product \(q\cdot x\) is the one of \({\mathbb {R}}^{\ell }\) where \(\ell =rn\), while the second scalar product \(p\cdot x_{h}\) is the one of \({\mathbb {R}}^{r}\).

  8. See [11].

  9. See [12].

  10. This is possible when the neighborhood is small enough thanks to the openness of \({\mathcal {V}}\).

  11. Like in standard microeconomics, for \(p \in {\mathbb {R}}^{\ell }_{++}\) and \(w>0\), the budget set B(pw) is defined by: \(B(p,w):=\lbrace x \in {\mathbb {R}}^{\ell }_{++}: p\cdot x \le w \rbrace \).

  12. See the appendix of [14].

  13. We write: \(\lambda ^{\varepsilon _{q}}_{k}:=\lambda ^{\varepsilon _{q}}_{k}(p_q,v_q)\) for \(k \in \lbrace 1,\ldots , n\rbrace \) and \(q\in \mathbb {N}\) to simplify the notation.

  14. See [11].

  15. Thanks to Proposition 3.1, K(pv) is nonempty.

  16. Indeed, K(pv) is a subset of M(pv)

  17. The vectors are, by convention, column vectors, and the transpose of a vector x is denoted by \(x^{T}\). We use the notation: \(\bar{\lambda }:=\lambda (\bar{p},\bar{v})\).

  18. To simplify the notation, for all \(k=1,\ldots , r\), we write \(\alpha _{k}(p):=\lambda (p,\bar{v})\).

References

  1. Barten, A., Böhm, V.: Consumer theory. In: Arrow, K.J., Intriligator, M. (eds.) Handbook of Mathematical Economics, vol. 2, pp. 381–429. North-Holland, Amsterdam (1982)

    Google Scholar 

  2. Diewert, E.: Duality approaches to microeconomic theory. In: Arrow, K.J., Intriligator, M. (eds.) Handbook of Mathematical Economics, vol. 2, pp. 535–599. North-Holland, Amsterdam (1982)

    Google Scholar 

  3. Penot, J.-P.: The bearing of duality in microeconomics. In: Kusuoka, S., Yamazaki, A. (eds.) Advances in Mathematical Economics, vol. 7, pp. 113–139. Springer, Tokyo (2005)

    Chapter  Google Scholar 

  4. McKenzie, L.: Demand theory without a utility index. The Review of Economic Studies 24(3), 185–189 (1957)

    Article  Google Scholar 

  5. Diamond, P.A., McFadden, D.: Some uses of the expenditure function in public finance. J. Public Econ. 3, 3–21 (1974)

    Article  Google Scholar 

  6. Cornet, B., Vial, J.P.: Lipschitzian solutions of perturbed non linear problems. SIAM J. Control Optim. 24, 1123–1137 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  7. Fiacco, A., McCormick, G.: Nonlinear Programming: Sequential Unconstrained Minimization Techniques. Classics in Applied Mathematics. SIAM, Philadelphia (1990)

    Book  MATH  Google Scholar 

  8. Bonnisseau, J.-M.: Regular economies with non-ordered preferences. J. Math. Econ. 39, 153–174 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  9. Mas-Colell, A., Whinston, M.D., Green, J.R.: Microeconomic Theory. Oxford University Press, New York (1995)

    MATH  Google Scholar 

  10. Laffont, J.J.: Fundamentals of Public Economics. The MIT Press, Cambridge (1988)

    Google Scholar 

  11. Eustaquio, R.G., Karas, E.W., Ribeiro, A.A.: Constraint qualifications for nonlinear programming. Technical report, Federal University of Parana (2010)

  12. Arrow, K.J., Enthoven, A.C.: Quasi-concave programming. Econometrica 29(4), 779–800 (1961)

    Article  MathSciNet  MATH  Google Scholar 

  13. Berge, C.: Topological Spaces. Dover Publications Mineola, New York (1997)

    Google Scholar 

  14. Florenzano, M.: General Equilibrium Analysis: Existence and Optimality Properties of Equilibria. Kluwer Academic Publishers, Boston (2003)

    Book  Google Scholar 

  15. Rader, T.: Nice demand functions. Econometrica 41, 913–935 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  16. Biheng, N., Bonnisseau, J.-M.: Regular economies with ambiguity aversion. J. Math. Econ. 59, 24–36 (2015)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgments

The author wishes to thank Jean-Marc Bonnisseau for his support and Alain Chateauneuf for his valuable comments. The author would also like to thank two anonymous referees and the editor for useful suggestions that improved the presentation of the paper. All remaining errors are his.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Noé Biheng.

Additional information

Communicated by Boris S. Mordukovich.

Appendix

Appendix

Lemma 8.1

The set \({\mathcal {V}}\) is an open set.

Proof

Let \(v^{0}\in {\mathcal {V}}\). We want to construct a neighborhood of \(v^0\) contained in \({\mathcal {V}}\). There exists \(x^{0} \in {\mathbb {R}}^{\ell }_{++}\) such that: \(u_{k}(x^{0})\ge v_{k}^{0}\) for all \(k=1,\ldots , n\), and there exists \(y^{0}\in {\mathbb {R}}^{\ell }_{++}\) and \(k_{0}\in \lbrace 1,\ldots , n\rbrace \) such that: \(u_{k_{0}}(y^0)< v_{k_{0}}^{0}\). Proceed to define \(\underline{v}\) by \(\underline{v}:=v^{0}-\mathbf {1}_{n}\) and \(\bar{v}\) by \(\bar{v}_{k}:=u_{k}(x^{0}+\mathbf {1}_{\ell })\) for \(k=1,\ldots , n\). Finally, we define the sets \(A:=\lbrace v\in {\mathbb {R}}^{n}:u_{k_{0}}(y^0) <v_{k_{0}}\rbrace \) and \(\displaystyle B:=\prod _{k=1}^{n}\left]\underline{v}_{k},\bar{v}_{k}\right[\). By construction, the set \(A\cap B\) is a nonempty open neighborhood of \(v^0\) contained in \({\mathcal {V}}\). Since \(v^0\) was arbitrarily chosen, one concludes that the set \({\mathcal {V}}\) is an open set.\(\square \)

Lemma 8.2

The sets of solutions of Problem (3) and Problem (4) coincide.

Proof

We first prove that the set of solutions of Problem (3) is a subset of the one of Problem (4). Let y be a solution of Problem (3). Since \(z_1\) is feasible for Problem (3), one finds: \( p\cdot y \le p\cdot z_{1}\). So y is feasible for Problem (4) and y is clearly a solution to Problem (4). In fact, the set of feasible points of Problem (4) is obviously contained in the set of feasible points of Problem (3).

Let y be a solution of Problem (4), and y is feasible for Problem (3) by construction. Let z be feasible for Problem (3), either \(-p\cdot z <-p\cdot z_1\) or \(-p\cdot z \ge -p\cdot z_1\). In the first case, obviously, \(-p\cdot z\le - p\cdot y\). In the second case, z is feasible for Problem (4). Thus, \(-p\cdot z \le -p\cdot z_1\le - p\cdot y\). Since z was arbitrarily chosen, we conclude that y is a solution to Problem (3). \(\square \)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Biheng, N. A Generalization of the Expenditure Function. J Optim Theory Appl 168, 661–676 (2016). https://doi.org/10.1007/s10957-015-0805-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10957-015-0805-x

Keywords

Mathematics Subject Classification

Navigation