In this task, you will solve maximization or minimization problems using the principles of linear programming. You will interpret the feasible region of linear programming and apply the simplex method to solve problems. Make sure to include correct mathematical procedures and provide clear and complete explanations and interpretations. In the case that the result is decimal, you will round it to two decimal places. 1. Use the principles of linear programming to maximize or minimize and interpret the following situation.

Maximize: = 3 + 4 Subject to: 2 + 4243 + 3214 + 220, 0

2. Use the principles of linear programming to maximize or minimize and interpret the following situation.

Minimize: = 3 + 8 Subject to: + 10 + 2153, 0

3. Sarah makes bracelets and necklaces to sell in a craft store. Each bracelet earns $ 7, takes 1 hour to assemble, and costs $ 2 for materials. Each necklace has a profit of $ 12, takes 2 hours to assemble, and costs $ 3 for materials. Sarah has 48 hours available to put together bracelets and necklaces. If she has $ 78 available to pay for supplies, she uses linear programming principles to determine how many bracelets and necklaces she should make to maximize her earnings.

4. She sue runs a soccer club and must decide how many members to send to soccer camp. She costs $ 75 for each advanced player and $ 50 for each intermediate player. She cannot spend more than $ 13,250. She sue she must send at least 60 more advanced than intermediate players and a minimum of 80 advanced players. She uses the principles of linear programming to find the number of each type of player that she Sue herself can send to camp to maximize the number of players in camp.

5. A company produces two models of calculators at two different plants. In one day, plant A can produce 140 of model 1 and 35 of model 2. In one day, plant B can produce 60 of model 1 and 90 of model 2. Suppose the company needs to produce at least 460 of model 1 and 340 for Model 2, which costs $ 1200 per day to operate Plant A and $ 900 per day for Plant B. Use the principles of linear programming to find the minimum cost.