Apply linear programming to this problem. A firm wants to determine how many units
of each of two products (products X and Y) they should produce in order to make the
most money. The profit from making a unit of product X is $190 and the profit from
making a unit of product Y is $112. The firm has a limited number of labor hours and
machine hours to apply to these products. The total labor hours per week are 3,000.
Product X takes 2 hours of labor per unit and Product Y takes 6 hours of labor per unit.
The total machine hours available are 750 per week. Product X takes 1 machine hour
per unit and Product Y takes 5 machine hours per unit. Which of the following is one of
the constraints for this linear program?
A.1 X + 5 Y =< 750
B.2 X + 6 Y => 750
C.2 X + 5 Y = 3,000
D.1 X + 3 Y =< 3,000
E.2 X + 6 Y =>3,000
Answer:
An activity-based map is which of the following?
A.A network guide to route airlines
B.A listing of activities that make up a project
C.A network that shows how a company’s strategy is delivered to customers
D.A facility layout schematic noting what is done where
E.A timeline displaying major planned events
Answer: