Formulate the following problem as a linear programming problem (DO NOT SOLVE).A company which
produces three kinds of spaghetti sauce has two plants. The East plant produces 3,500 jars of plain sauce, 6,500
jars of sauce with mushrooms, and 3,000 jars of hot spicy sauce per day. The West plant produces 2,500 jars of
plain sauce, 2,000 jars of sauce with mushrooms, and 1,500 jars of hot spicy sauce per day. The cost to operate
the East plant is $8,500 per day and the cost to operate the West plant is $9,500 per day. How many days should
each plant operate to minimize cost and to fill an order for at least 8,000 jars of plain sauce, 9,000 jars of sauce
with mushrooms, and 6,000 jars of hot spicy sauce? (Let x1 equal the number of days East plant should operate
and x2 the number of days West plant should operate.)
Minimize C =8,500x1+9,500x2
subject to 3,500x1+2,500x2
8,000
6,500x1+2,000x2
9,000
3,000x1+1,500x2
6,000
x1, x2
0
Formulate the following problem as a linear programming problem (DO NOT SOLVE):A small accounting firm
prepares tax returns for two types of customers: individuals and small businesses. Data is collected during an
interview. A computer system is used to produce the tax return. It takes 2.5 hours to enter data into the
computer for an individual tax return and 3 hours to enter data for a small business tax return. There is a
maximum of 40 hours per week for data entry. It takes 20 minutes for the computer to process an individual tax
return and 30 minutes to process a small business tax return. The computer is available for a maximum of 900
minutes per week. The accounting firm makes a profit of $125 on each individual tax return processed and a
profit of $210 on each small business tax return processed. How many of each type of tax return should the firm
schedule each week in order to maximize its profit? (Let x1 equal the number of individual tax returns and x2
the number of small business tax returns.)