For the following linear programming problem:
- Write the linear programming model: Objective function and its constraints.
- Draw the feasible solution for the LP problem. The Janie Gioffre Drapery Company makes three types of draperies at two different locations.
At location I, it can make 10 pairs of deluxe drapes, 20 pairs of better drapes and 13 pairs of standard drapes per day. At location II, it can make 20 pairs of deluxe, 50 pairs of better and 6 pairs of standard per day.
The company has orders of 2000 pairs of deluxe drapes, 4200 pairs of better drapes and 1200 pairs of standard drapes. The daily costs are $500 per day at location I and $800 per day at location II.
How many days should Janie schedule at each location in order to fill the orders at minimum cost? What is the minimum cost? Quote me the price.