Showing 121 - 130 of 168
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/10012543157
Persistent link: https://www.econbiz.de/10012543162
Persistent link: https://www.econbiz.de/10012543174
Persistent link: https://www.econbiz.de/10012543226
Persistent link: https://www.econbiz.de/10013546140
Persistent link: https://www.econbiz.de/10013547325
Persistent link: https://www.econbiz.de/10013455303
Persistent link: https://www.econbiz.de/10013486463
Persistent link: https://www.econbiz.de/10013486572