Linear Programming and Convex Separable Objective Functions

This paper is an attempt to explain and illustrate the basis for and the methodology of the linear or mathematical programming approach to economic problems.This paper will not be geared toward post-calculus mathematicians, but rather the ideas of linear programming will be set forth in simple examples, involving little more than high school algebra.Graphs will be used as well to explain the two-dimensional problems.The scope of this thesis will revolve around a rather complete description of the basic assumptions of linear programming, the formulation and solution of simple linear programming problems, the concept of separable objective functions, and the economic meaning and interpretation that can be obtained from linear programming.The scope of the examples used is kept narrow so that the ideas involved in the formulation of such problems do not become lost among the figures.The goal of the paper is to serve as an introduction and first exposure to the concepts of linear programming for those familiar with economic principles. Advisor: Gerald E. Thompso