Optimisation in reserve selection procedures - why not?

  • Rodrigues A
  • Gaston K
  • 71


    Mendeley users who have this article in their library.
  • N/A


    Citations of this article.


Linear programming techniques provide an appropriate tool for solving
reserve selection problems. Although this has long been known, most
published analyses persist in the use of intuitive heuristics, which
cannot guarantee the optimality of the solutions found. Here, we dispute
two of the most common justifications for the use of intuitive
heuristics, namely that optimisation techniques are too slow and cannot
solve the most realistic selection problems. By presenting an overview
of processing times obtained when solving a diversity of reserve
selection problems, we demonstrate that most of those published could
almost certainly be solved very quickly by standard optimisation
software using current widely available computing technology. Even for
those problems that take longer to solve, solutions with low levels of
sub-optimality can be obtained quite quickly, presenting a better
alternative to intuitive heuristics. (C) 2002 Elsevier Science Ltd. All
rights reserved.

Author-supplied keywords

  • complementarity; conservation priorities; linear p

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in


  • A S L Rodrigues

  • K J Gaston

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free