Solve maximization or minimization problems using the principles of linear programming. Interpret the feasible region of a linear programming and apply the simplex method to solve problems. 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 linear programming principles to maximize or minimize and interpret the following situation. Maximizes: z = 3x + 4y Subject to: 2x + 4y S 24 3x + 3y 15 y23 x, y 20 3. Sarah makes bracelets and necklaces to sell in a craft shop. Each bracelet has a profit of $7, takes 1 hour to assemble and costs $2 for the materials. Each necklace has a profit of $12, takes 2 hours to assemble and costs $3 for the materials. Sarah has 48 hours available to assemble bracelets and necklaces. If you have $78 available to pay for materials, use linear programming principles to determine how many bracelets and necklaces you need to do to maximize your earnings.4. Sue manages a football club and must decide how many members to send to the football camp. It costs $75 for each advanced player and $50 for each intermediate player. You can't spend more than $13,250. Sue must send at least 60 more advanced than intermediate players and a minimum of 80 advanced players. Use linear programming principles to find the number of each type of player Sue can send to the camp to maximize the number of players in the camp 5. A company produces two models of calculators on two different floors. 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 of model 2 and that it costs $1200 per day to operate Plant A and $900 per day Plant B. Use linear programming principles to find the minimum cost