Formulation of Linear programming:
Decision Variables:
Let x,y,z be the number of quantities of statutes, lamps and urns produced.
Objective : To maximize the overall profit from the sale of the three type of artifacts
Objective function: Total Profit = Sumproduct (Profit/unit , Number of units of each artifact)
Max (Profit) = 199x +99y +145z
Subject to constraints:
13x + 18y + 17z <= 28,000
(Capacity constraint for availability of clay used for production. Maximum of 28,000 ounces of clay is available)
0.8x + 0.7y + z <= 1,200
(Inventory Holding of Special material. Maximum of 1,200 ounces of special material could be used for production)
x <= 275 (Production limit of quantities of Statutes that can be manufactured)
x,y,z >= 0 (Non-Negative Integer Constraint)
Solution:

Production Quantities:
x = 275 units
y = 0 units
z = 980 units
Profit = $ 196,825
2. Geniue Antique Egyptian Artifacts, Inc. produces three varieties of antique artifacts for sale to tourists:...