Use Pulp to maximize profit on the following linear programming problem.

An operations manager is trying to determine a production plan for the next week. There are two products (say, P1 and P2) to produce using four machines (say, MA and MB, MC, and MD). Each of the four machines performs a unique process. There is one machine of each type, and each machine is available for 5400 minutes per week. The unit processing times for each machine is given in Table 1.

Table 1. Unit Processing Time (min)

The unit revenues and maximum sales for the week are indicated in Table 2. Storage from one week to the next is not permitted. The operating expenses associated with the plant are $10000 per week, regardless of how many components and products are made. The $10000 includes all expenses except for material costs.

Table 2. Product Data

Machine Product P1 Product P2 Availability (min) 5400 20 MA MB MC MD Total processing time 25 14 34 15 10 5400 5400 41 21600 Machine Product P1 Product P2 Availability (min) 5400 20 MA MB MC MD Total processing time 25 14 34 15 10 5400 5400 41 21600