✦ LIBER ✦

Ordinal Efficiency and the Polyhedral Separating Hyperplane Theorem

✍ Scribed by Andrew McLennan

Book ID: 112258257
Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 138 KB
Volume: 105
Category: Article
ISSN: 0022-0531
DOI: 10.1006/jeth.2001.2864

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a calculation of an arbitrary separat

On a calculation of an arbitrary separating hyperplane of convex polyhedral sets

✍ Grygarová, L. 📂 Article 📅 1998 🏛 Taylor and Francis Group 🌐 English ⚖ 452 KB

A constructive proof of the ordinal effi

A constructive proof of the ordinal efficiency welfare theorem

✍ Mihai Manea 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 145 KB

The Lefschetz Theorem on Hyperplane Sect

The Lefschetz Theorem on Hyperplane Sections

✍ Aldo Andreotti and Theodore Frankel 📂 Article 📅 1959 🏛 John Hopkins University Press 🌐 English ⚖ 38 KB

The theorem of Lie and hyperplane subalg

The theorem of Lie and hyperplane subalgebras of Lie algebras

✍ Detlev Poguntke 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 381 KB

The theorem of the means for cardinal an

The theorem of the means for cardinal and ordinal numbers

✍ George Rousseau 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 382 KB

## Abstract The theorem that the arithmetic mean is greater than or equal to the geometric mean is investigated for cardinal and ordinal numbers. It is shown that whereas the theorem of the means can be proved for __n__ pairwise comparable cardinal numbers without the axiom of choice, the inequalit

An algorithmic proof of the polyhedral d

An algorithmic proof of the polyhedral decomposition theorem

✍ Mustafa Akgül 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 504 KB