Operations Research Models and Methods / Computation / Mathematical Programming /
Linear/Integer Programming

Example: A Product Mix Problem

A type of problem most often identified with linear programming is the problem of distributing scarce resources among alternative activities. In this example the scarce resources are times available on four machines types and the alternative activities are the production quantities of five products. The machine requirements in hours per unit are shown for each product in the table below. With the exception of product 4, that does not require machine 1, each unit of product must pass through all four machine types. The unit profits for each product are also shown in the table. There are four machines of type 1, five of type 2, three of type 3 and seven of type 4. Each machine operates 40 hours per week. The problem is to determine the optimum weekly production quantities for the products. The goal is to maximize total profit.


Specifying Model Characteristics

Updated 1/16/01
Operations Research Models and Methods

by Paul A. Jensen and Jon Bard, University of Texas, Copyright by the Authors