Methods of Linear Programming for Students of Mathematics and Science (UMAP)

This module involves methods of linear programming for students of mathematics and science.

Table of Contents:

1. INTRODUCTION

2. CONVEX COORDINATES AND BASIC FEASIBLE SOLUTIONS
2.1 Triangles in the Coordinate Plane
2.2 Closed Polyhedral Regions in Higher Dimensions

3. EXAMPLE, SOLUTIONS, AND COMMENTS
3.1 Two-Dimensional Examples
3.2 Three-Dimensional Examples

4. MODEL EXAMINATION

5. REFERENCES

6. ANSWERS FOR THE EXERCISES

7. ANSWERS FOR THE MODEL EXAMINATION