A plant can invoice five products A, B, C, D, E in any combination. Each product requires time from each of three machines as shown in figure 2.30. Each machine is available 128 hours per week. Products A, B, C, D and E are clearly competitive and any quantity that is manufactured can be sold at the respective prices $ 5, $ 4, $ 5, $ 4 and $ 4. The variable labor hour costs are $ 4 for Machines 1 and 2 and $ 3 for Machine 3. The material costs for each pound of products are $ 2 for A and C and $ 1 for B, D, and E. You want maximize the firm's profits. Formulate this problem with a linear programming model using as few variables as possible. FIGURA 2.30. Tiempo de FIGURA 2.31. Datos por granja de rea y mquina (Minutos por trabajo libra del producto) MQUINA HORAS DE TRABAJO GRANJA REA UTILIZABLE DISPONIBLES POR MES PRODUCTO 500 1700 2 900 3000 300 B 900 700 2200 C 3 E 7 11 2 1 3 1 3 4 12 7 8 10 8 9 4 0 10 7 D Check the results in both the objective equation and the constraints. Interpret the results of the proposed problem Take a new assessment: What if. Product C must be sold maximum 10 units * If machines 1 and 3 have 115 hours each available * If the costs for B and E are $ 2. Check the results in both the objective equation and the constraints and interpret the results A plant can invoice five products A, B, C, D, E in any combination. Each product requires time from each of three machines as shown in figure 2.30. Each machine is available 128 hours per week. Products A, B, C, D and E are clearly competitive and any quantity that is manufactured can be sold at the respective prices $ 5, $ 4, $ 5, $ 4 and $ 4. The variable labor hour costs are $ 4 for Machines 1 and 2 and $ 3 for Machine 3. The material costs for each pound of products are $ 2 for A and C and $ 1 for B, D, and E. You want maximize the firm's profits. Formulate this problem with a linear programming model using as few variables as possible. FIGURA 2.30. Tiempo de FIGURA 2.31. Datos por granja de rea y mquina (Minutos por trabajo libra del producto) MQUINA HORAS DE TRABAJO GRANJA REA UTILIZABLE DISPONIBLES POR MES PRODUCTO 500 1700 2 900 3000 300 B 900 700 2200 C 3 E 7 11 2 1 3 1 3 4 12 7 8 10 8 9 4 0 10 7 D Check the results in both the objective equation and the constraints. Interpret the results of the proposed problem Take a new assessment: What if. Product C must be sold maximum 10 units * If machines 1 and 3 have 115 hours each available * If the costs for B and E are $ 2. Check the results in both the objective equation and the constraints and interpret the results
