18
It follows that
Aj⅝' ≥ λicbii ⅛ λid - λ7c∣δn∙∣
= c(λiba — λj ∖bji I) + λid
> Xid
> 0.
Hence we have
On the other hand, it is not difficult to see that the procedure will terminate
within a finite number of iterations since each entry ‰7∙ is hnite. Hence the procedure
produces the matrix A = AU in standard form where U is a unimodular matrix.
We complete the proof. □
We remark that the origin of Rn is still contained in the interior of the convex
hull of the vectors ɑɪ,..., an+1. Moreover, the corresponding convex combination
coefficients remain unchanged. It is also easy to show that the volume of the simplex
does not change under unimodular transformation. For n = 2, we can construct
such unimodular matrices by adapting Scarf’s method in [10]. The procedure now
can be applied.
Let us give some examples.
Example 5. We are given
0 -1
1 1
-1 0
Then
1 1
-1 0
More intriguing information
1. ANTI-COMPETITIVE FINANCIAL CONTRACTING: THE DESIGN OF FINANCIAL CLAIMS.2. Integration, Regional Specialization and Growth Differentials in EU Acceding Countries: Evidence from Hungary
3. NATURAL RESOURCE SUPPLY CONSTRAINTS AND REGIONAL ECONOMIC ANALYSIS: A COMPUTABLE GENERAL EQUILIBRIUM APPROACH
4. The Tangible Contribution of R&D Spending Foreign-Owned Plants to a Host Region: a Plant Level Study of the Irish Manufacturing Sector (1980-1996)
5. Gender and aquaculture: sharing the benefits equitably
6. Dendritic Inhibition Enhances Neural Coding Properties
7. The name is absent
8. The name is absent
9. The name is absent
10. AJAE Appendix: Willingness to Pay Versus Expected Consumption Value in Vickrey Auctions for New Experience Goods