Let,
X1 = No. of product C to be produced
X2 = No. of product D to be produced
X3 = No. of product E to be bought
X4 = No. of product E to be produced
Objective Function: Maximize. Z = Total Profit = Revenue – Cost = 11(X1 – X2) + 23X2 – 5X3
or, Z = 11X1 + 12X2 – 5X3
Subject to,
2X1 + 2X4 ≤ 1300 (Machine 1 available time)
2X2 ≤ 500 (Machine 2 available time)
1X1 + 2X2 – X3 – X4 = 0 (Balance of E)
X1, X2, X3, X4 ≥ 0
———————–
LINDO Code
Max 11X1 + 12X2 – 5X3
ST
2X1 + 2X4
“Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!”
What Students Are Saying About Us
.......... Customer ID: 12*** | Rating: ⭐⭐⭐⭐⭐"Honestly, I was afraid to send my paper to you, but splendidwritings.com proved they are a trustworthy service. My essay was done in less than a day, and I received a brilliant piece. I didn’t even believe it was my essay at first 🙂 Great job, thank you!"
.......... Customer ID: 14***| Rating: ⭐⭐⭐⭐⭐
"The company has some nice prices and good content. I ordered a term paper here and got a very good one. I'll keep ordering from this website."