Linear programming is a method for finding the optimal (best possible) solution that meets all the conditions for a problem such as the following. 

A factory can have no more than 200 workers on a shift, but must have at least 100 and must manufacture at least 3000 units at minimum cost. How many workers should be on a shift in order to produce the required units at minimal cost? 

Let x represent the number of workers and y represent the number of units manufactured.

Graph the inequalities from Exercise 55 using the axes below, and shade the intersection.

Data from in Exercise 55

Write three inequalities expressing the problem conditions.

-5000 3000 1000 100 300 500