ED1: ESTRUCTURAS Y PROGRAMACIÓN

Alumno: Miguel Terreros Amaya

Cuatrimestre y grupo: 2 “A”
Asignatura: Lógica de programación
Docente: Arturo Contreras Juárez

EJERCICIO 3 – COMPUQUICK

CompuQuick Corporation produces two models of computers—Standard and Turbo. CompuQuick

can sell every Standard unit it produces for a profit contribution of $100, and each Turbo unit for a
contribution of $150. At the CompuQuick factory, the Standard computer production line can
produce, at most, 100 computers for day. At the same time, the Turbo computer production line
can turn out 120 computers per day.
Furthermore, CompuQuick has a limited supply of daily labor. In particular, there is a total of 160
hours of labor available each day. Standard computers require 1 hour of labor, while Turbo
computers are relatively more labor intense requiring 2 hours of labor.
The problem for CompuQuick is to determine the mix of Standard and Turbo computers to
produce each day to maximize total profit without exceeding line and labor capacity limits.

R= La empresa de CompuQuick puede optar para maximizar la ganancia total una venta de 130
piezas de ambas computadoras por día sin exceder la linea y capacidad de la mano de obra