Linear Programming Problem
Es posible que este libro digital no cumpla las normas de accesibilidad y no sea totalmente compatible con las tecnologías de asistencia.
A box manufacturing plant makes two types of boxes, each of which requires time on the saw for cutting, then time on the assembly and later for finishing. Suppose Model A requires 1 hour cutting, 2 hours of assembly and 1 hour of finishing. Model B requires 1 hour of cutting, 1 hour of assembly and 3 hours of finishing. There are 40 man hours available for cutting per week, 60 man hours for assembly and 90 man hours for finishing. Suppose each model A box sold brings in $20 profit and each model B box sold brings in $25 profit. Determine the number of each box that should be produced to maximize the profit.
Detalles
- Fecha de publicación
- Apr 4, 2013
- Idioma
- English
- Categoría
- Educación e idioma
- Copyright
- Todos los derechos reservados - Licencia estándar de copyright
- Contribuyentes
- Por (autor o autora): Homework Help Classof1
Especificaciones
- Formato