Showing 1 - 10 of 36
Persistent link: https://www.econbiz.de/10011415924
Persistent link: https://www.econbiz.de/10011415990
Persistent link: https://www.econbiz.de/10012881452
Persistent link: https://www.econbiz.de/10011690722
Persistent link: https://www.econbiz.de/10011809789
Persistent link: https://www.econbiz.de/10011637035
This paper discusses the complexity and computability of the ‘Deissenberg Problem’ of finding the ‘best’ point in the efficient set. It is shown that the problem is computably undecidable and that the efficient set of the problem is algorithmically complex.
Persistent link: https://www.econbiz.de/10012429669
Persistent link: https://www.econbiz.de/10012543226
Persistent link: https://www.econbiz.de/10013546140
Persistent link: https://www.econbiz.de/10013475844