Overview

This week culminates the matrix / systems of linear equations section of this course. The week is designed to give you a broad overview of spatial optimization techniques. At the conclusion of last week, you formulated a model, but we left the problem unsolved. This week, we will utilize the Simplex method to solve a system and then solve an integer programming problem. This is a very high level overview on problems designed to be solvable by hand. This overview is only designed to help you decided if, later in your academic careers, you want to enroll in a more in depth spatial optimization course.

Objectives

At the conclusion of this chapter and the associated assignment, you will be able to:

• formulate an optimization problem in matrix form;
• solve an optimization problem using the Simplex method;
• define integer programming and solve an integer programming model using the branch and bound technique.