Same question that I have asked earlier but need to derive the objective function and constraints and solved using Management Scientist Software.
A company excavates gold and silver from 2 different mines. Each hour that the company operates in Mine 1 produces 2 kg of gold and 2 kgs of silver. Each hour the company operates in Mine 2 produces 1 kg of gold and 3 kgs of silver. To reach break-even point, the company must produce at least 12 kg of gold and 18 kg of silver per day. Develop a formulation of Linear Programming by using Management Scientist Software to identify the minimum operational hours at each mine to reach their break even point.