Article contents
Some Generalizations of Carathéodory′s Theorem Via Barycentres, with Application to Mathematical Programming
Published online by Cambridge University Press: 20 November 2018
Abstract
Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
A theorem on the barycentre of a measure is proven which leads to generalization of Carathéodory′s theorem and to extension of various results. A mathematical programming problem is examined in application.
- Type
- Research Article
- Information
- Copyright
- Copyright © Canadian Mathematical Society 1980
References
1.
Blackwell, D. and Girshick, M.A., Theory of games and statistical decisions, John Wiley, New York, 1954.Google Scholar
2.
Cook, W.D., Carathéodory's Theorem with Linear Constraints, Canadian Math. Bull.
17 (1974), pp. 189-191.Google Scholar
3.
Cook, W.D., Field, C.A. and Kirby, M. J. L., Infinite Linear Programming in Games with Partial Information, Operations Research
23 (1975), pp. 996-1010.Google Scholar
4.
Cook, W.D. and Webster, R.J., Carathéodorf s Theorem, Canadian Math. Bull.
15 (1972), p. 293.Google Scholar
8.
ter Morsche, H. G., Problem 341, Problem Section Nieuw Archief voor Wiskunde
21 (1973), p. 98. See also: Solutions of problem 341, Nieuw Archief voor Wiskunde 21 (1973), pp. 292-293 and 22 (1974), p. 85.Google Scholar
9.
Tijs, S.H., Semi-infinite and infinite matrix games and bimatrix games, Ph.D. dissertation, University of Nijmegen, The Netherlands, 1975.Google Scholar
- 5
- Cited by