Harrison and Lara have discovered a counterfeit jewelry operation. Two workers, Choot and Wanlah, sell fake "gold" watches and "diamond" rings for a notoriously frugal mob boss. They need to gather intel and file a report on their discovery.
The adventurers learn that the mob boss demands a minimum of 12 watches and 30 rings to be sold every day, and has figured out how to get what he wants while paying his two workers the least possible amount (while still honouring their agreed-upon hourly wages). While Lara and Harrison can't tell how many hours each worker spends selling the jewelry, or how many items they actually sell each day.
a. list the constraints
b.
what is the optimization equation?
a. The constraints for this problem are:
1. The number of watches sold by Choot and Wanlah combined should be at least 12.
2. The number of rings sold by Choot and Wanlah combined should be at least 30.
3. The total cost of paying Choot and Wanlah their hourly wages should be minimized.
b. The optimization equation for this problem would be to minimize the total cost of paying Choot and Wanlah while still meeting the minimum sales requirements.
a. The constraints in this scenario are as follows:
1. The mob boss demands a minimum of 12 watches and 30 rings to be sold every day.
2. The workers, Choot and Wanlah, have agreed upon hourly wages.
3. The total number of watches and rings sold each day should be greater than or equal to the minimum quantities demanded.
b. The optimization equation in this case would be to minimize the total cost of paying the workers, while still ensuring that the minimum quantities of watches and rings are sold each day.