1 resultado para Convex infinite programming
em Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest
Filtro por publicador
- Aberystwyth University Repository - Reino Unido (12)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (2)
- Applied Math and Science Education Repository - Washington - USA (1)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (1)
- Archive of European Integration (5)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (4)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (8)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (18)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (1)
- Boston University Digital Common (5)
- Brock University, Canada (17)
- Bulgarian Digital Mathematics Library at IMI-BAS (3)
- CaltechTHESIS (18)
- Cambridge University Engineering Department Publications Database (99)
- CentAUR: Central Archive University of Reading - UK (69)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (24)
- Cochin University of Science & Technology (CUSAT), India (5)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (54)
- CORA - Cork Open Research Archive - University College Cork - Ireland (3)
- Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest (1)
- CUNY Academic Works (3)
- Dalarna University College Electronic Archive (3)
- Deakin Research Online - Australia (57)
- Department of Computer Science E-Repository - King's College London, Strand, London (16)
- DI-fusion - The institutional repository of Université Libre de Bruxelles (1)
- DigitalCommons@University of Nebraska - Lincoln (1)
- Diposit Digital de la UB - Universidade de Barcelona (1)
- DRUM (Digital Repository at the University of Maryland) (2)
- Duke University (8)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (1)
- Greenwich Academic Literature Archive - UK (4)
- Helda - Digital Repository of University of Helsinki (5)
- Indian Institute of Science - Bangalore - Índia (123)
- Instituto Politécnico do Porto, Portugal (22)
- Massachusetts Institute of Technology (18)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (2)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (114)
- Queensland University of Technology - ePrints Archive (69)
- RDBU - Repositório Digital da Biblioteca da Unisinos (1)
- Repositório Científico da Universidade de Évora - Portugal (1)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (1)
- Repositório digital da Fundação Getúlio Vargas - FGV (8)
- Repositório Digital da Universidade Municipal de São Caetano do Sul - USCS (5)
- Repositório Institucional da Universidade de Aveiro - Portugal (4)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (84)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (2)
- SAPIENTIA - Universidade do Algarve - Portugal (6)
- Universidad de Alicante (12)
- Universidad del Rosario, Colombia (3)
- Universidad Politécnica de Madrid (2)
- Universidade Complutense de Madrid (1)
- Universidade de Lisboa - Repositório Aberto (2)
- Universidade Federal do Rio Grande do Norte (UFRN) (1)
- Universita di Parma (1)
- Universitat de Girona, Spain (5)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (7)
- Université de Lausanne, Switzerland (1)
- Université de Montréal, Canada (8)
- University of Southampton, United Kingdom (32)
- University of Washington (1)
- WestminsterResearch - UK (3)
Relevância:
Resumo:
In this paper we consider a primal-dual infinite linear programming problem-pair, i.e. LPs on infinite dimensional spaces with infinitely many constraints. We present two duality theorems for the problem-pair: a weak and a strong duality theorem. We do not assume any topology on the vector spaces, therefore our results are algebraic duality theorems. As an application, we consider transferable utility cooperative games with arbitrarily many players.