---
res:
  bibo_abstract:
  - 'We consider the classical LINEAR OPTIMIZATION Problem, but in the Turing rather
    than the RealRAM model. Asking for mere computability of a function''s maximum
    over some closed domain, we show that the common presumptions ''full-dimensional''
    and `bounded'' in fact cannot be omitted: The sound framework of Recursive Analysis
    enables us to rigorously prove this folkloristic observation! On the other hand,
    convexity of this domain may be weakened to connectedness, and even NON-linear
    functions turn out to be effectively optimizable.@eng'
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Vasco
      foaf_name: Brattka, Vasco
      foaf_surname: Brattka
  - foaf_Person:
      foaf_givenName: Martin
      foaf_name: Ziegler, Martin
      foaf_surname: Ziegler
  dct_date: 2001^xs_gYear
  dct_language: eng
  dct_title: Turing Computability of (Non-)Linear Optimization@
...