LONG QUIZ No.

1 LP Problems using Graphical Solution (SET A) INSTRUCTIONS : a) (5 pts) Create the mathematical matrix of the given in the problem with labels and unit of measure. b) (10pts) Formulate the original mathematical model and its transpose with labels. c) (15 pts) Of the original mathematical model, draw the lines of the constraints on the graph and determine the feasible region. Give the coordinates of the intersection points. Identify if the feasible region is bounded, unbounded or infeasible. d) (10 pts) Of the original mathematical model, determine the Optimal Solution by using the Corner (Extreme) Points Theorem. You must indicate the values of the decision variables and the optimal solution with the right unit of measure. e) (10 pts) Of the original mathematical model, create at least two (2) the isocost/isoprofit lines to be able to identify the optimal solution that touches the lowest/highest part of the feasible region and be able to determine which of the constraints are binding and/or non-binding. WORD PROBLEM ( use 3 decimal places) ABC Corporation makes household cleansers in two strengths: weak and strong. Each gallon of the weak cleanser contains 1 liter of acid solution and 10 grams of emulsifier. Each gallon of the stronger cleanser contains 2 liters of acid solution and 30 grams of emulsifiers. Moreover, due to Government Regulations, the Chemist of ABC Corp. must see to it that the water content of the strong cleanser cannot exceed twice the amount of water of the weak cleanser. According to contracts entered into by the firm with its suppliers, ABC Corporation must use at least 40 liters of acid solution and 450 grams of emulsifiers each week. It costs the company Php 50.00 to make a gallon of weak cleanser and Php 80.00 to make each gallon of stronger cleanser. How many gallons of each kind of household cleansers should the firm make each week in order to minimize its costs?

LONG QUIZ No. 1 LP Problems using Graphical Solution (SET B) INSTRUCTIONS : a) (5 pts) Create the mathematical matrix of the given in the problem with labels and unit of measure. b) (10pts) Formulate the original mathematical model and its transpose with labels. c) (15 pts) Of the original mathematical model, draw the lines of the constraints on the graph and determine the feasible region. Give the coordinates of the intersection points. Identify if the feasible region is bounded, unbounded or infeasible. d) (10 pts) Of the original mathematical model, determine the Optimal Solution by using the Corner (Extreme) Points Theorem. You must indicate the values of the decision variables and the optimal solution with the right unit of measure. e) (10 pts) Of the original mathematical model, create at least two (2) the isocost/isoprofit lines to be able to identify the optimal solution that touches the lowest/highest part of the feasible region and be able to determine which of the constraints are binding and/or non-binding. WORD PROBLEM ( use 3 decimal places) A silver processor has 2 sources of silver ore, Plant X and Plant Y. In order to keep his plant running, at least 3 tons of silver ore must be processed each day. Ore from Plant X costs Php 2,500.00 per ton to process, and ore from Plant Y costs Php 1,500.00 per ton to process. Costs must be kept to less than Php 10,000 per day. Moreover, Government Regulations require that the amount of silver ore from Plant Y cannot exceed twice the amount of silver ore from Plant X. If ore from Plant X yields 3 oz of silver per ton, and the ore from Plant Y yields 4 oz of silver per ton, how many tons of ore from both plants must be processed each day to maximize the amount of gold extracted subject to the above constraints?