It is argued that the problem of choosing a subset of candidate reserves as the components of a reserve system can, in the right circumtances, be sensibly and routinely formulated as a mathematical programming problem, namely an integer goal programming problem. This remains true even when the entities being reserved are known to exist on candidate reserves only in a probabilistics sense. An example using data describing 101 remnant patches of bush on the Eyre Peninsula, South Australia is presented.