PDF Version of this document Search Help Glossary

Lesson Navigation IconIntermediate Suitability Analysis

Unit Navigation IconFuzzy overlay

Unit Navigation IconMulti-objective analysis

LO Navigation IconConflicting and non-conflicting objectives

LO Navigation IconDecision heuristics

LO Navigation IconMOLA

LO Navigation IconCritical review of the MOLA approach

LO Navigation IconSelf Assessment

LO Navigation IconSelf Assessment

LO Navigation IconRecommended Reading

Unit Navigation IconSummary

Unit Navigation IconRecommended Reading

Unit Navigation IconGlossary

Unit Navigation IconBibliography

Unit Navigation IconMetadata

GITTA/CartouCHe news:

Go to previous page Go to next page

Critical review of the MOLA approach

The MOLA procedure is easy to understand and thus very well suited for participatory decision making processes. Furthermore, it is fast and capable of processing large data sets. Although we examined only two conflicting objectives, the 2D decision space could be extended to a multi-dimensional space representing many conflicting objectives. However, with more than three objectives the approach loses its graphic simplicity and becomes harder to interpret.

The MOLA-approach is not the only way to allocate land use. Almost any optimization technique can be used. Another commonly used approach within the GIScience field is called linear programming. Linear programming is a method of finding an optimal solution to problems that require several factors to be balanced against each other. In our case these factors are conflicting land-use objectives. Thus, linear programming for land-use allocation is used to achieve optimal land-use, where defined objectives can be maximized and constraints are respected. It is called linear programming because the optimization is achieved by optimizing a set of linear functions representing the decision variables.

The further reading section of this unit gives you some starting points to explore the literature on linear programming with GIS.

Top Go to previous page Go to next page