The Electrocomp Corporation manufactures two electric products: air conditioners and large fans. The assembly process for each is similar in that both require a certain among of wiring and drilling. Each air conditioners takes 3hours of wiring and drilling. Each air conditioner takes 3 hours of wiring and 2 hours of drilling. Each fan must go through 2 hours of wiring and 1 hour of drilling. During the next production period, 240 hours of wiring time are available and up to 140 hours of drilling time may be used. Each air conditioner sold yields a profit $25. Each fan assembled may be sold for a $15 profit. Formulate and solve this LP production mix situation to find the best combination of air conditioners and fans that yields the highest profit.
Solution
Let X1 and X2 be the decision variables denoting air conditioners and large fans produced by the company respectively.
Step: Formulation of the L.P model.
Constraints | Air conditioners | Large fan | Availability |
Hiring | 3 hours | 2 hours | 240 hours |
Drilling | 2 hours | 1 hours | 140 hours |
Profit | $25 | $15 |
Step 2
Using the corner point graphical method:
Simplify the constraints by dividing them with a common factor. This now becomes.
The points | Z=25x1+15x2 | Total |
A | (0, 0) | 0 |
B | (70, 0) | 1750 |
C | (60, 40) | 2100 |
D | (0,120) | 1800 |
X1 and X2 is 60 and 40 respectively. Therefore, the company should 60 air conditioners and 40 fans to realize maximum profit of 2100.
Problem 7-15
Electrocamp’s management realizes that it forgot to include two critical constraints. In particular, management decides that there should be a minimum number of air conditioners produced in order to fulfil a contract. Also, due to an oversupply of fans in the preceding period, a limit should be placed on the total number of fans produced.
Solution
Step: Standard form
Step 2: initial simplex tableau
Cj | 25 | 15 | 0 | M | |||
CB | Bv | X1 | X2 | S1 | R1 | bj | Ratio |
M | R1 | 3 | 2 | 0 | 1 | 240 | 80 |
0 | S1 | 2 | 1 | 1 | 0 | 140 | 70 |
Zj | 3m | 2m | 0 | m | 240m+140m | ||
Cj-Zj | 25-3m | 15-3m | 15-2m | 0 | 0 | ||
Since it is a minimization problem we pick the most negative Cj-Zj. Entering X1, departing S1 and pivot 2.
Step 3: New simplex tableau
Cj | 25 | 15 | 0 | M | |||
CB | BV | X1 | X2 | S1 | R1 | bj | Ratio |
M | R1 | 0 | 0.5 | -1.5 | 1 | 30 | 60 |
25 | X1 | 1 | 0.5 | ½ | 0 | 70 | 140 |
Zj | 25 | 0.5m+25/2 | -3/2m+25/2m | 30m+1750 | |||
Cj-Zj | 0 | 5/2-0.5m | 3/2m-25/2 | 0 |
The solution is optimal but not feasible. Pick the most negative Cj-Zj. Entering variable X2, departing R1 and pivot ½.
Step 4: New simplex tableau
Cj | 25 | 15 | 0 | ||
CB | BV | X1 | X2 | S1 | bj |
15 | X2 | 0 | 1 | 3 | 60 |
25 | X1 | 2 | 0 | 4 | 80 |
Zj | 50 | 15 | 25 | 2900 | |
Cj-Zj | -25 | 0 | -35 |
Optimality has been reached.
X1=80 and X2=60
Max Z=2900 is the optimal solution of the question.
X1≥20 and X2≤80
Take the value of X1 and X2, then substitutes to the new constraints.
80≥20 and 60≤80 which is true.
Conclusion: The current solution will still be optimal since the optimal solution is not affected.
X1≥30 and X2≤50
Fixing the values of X1 and X2 to the new constraints to be added we yield:
80≥30 true and 60≤50 which is false.
Problem 7-18
The dean of the western college of Business must plan the school course offering for the fall semester. Students make it necessary to offer at least 30 undergraduates and 20 graduates in the term. Faculty contracts also dictate that at least 60 courses be offered in total. Each undergraduate course taught costs the college and average $2500 in faculty wages, and each graduate course costs $3000. How many graduates and undergraduates should be taught in the fall so that total faculty salaries are kept to a minimum?
Solution
Let X1 and X2 be the decision variable denoting undergraduates and graduates courses offered in the college.
Step 1: Formulate the problem
X1≥30,
X2=20,
X1+X2≥60
X1, X2≥0
minZ =2500X1+300X2
Step 2: Standard form
X1-S1+R1=30
X2+R2=20
X1+X2-S1+R3=60
Min Z= 2500X1 +3000X2+0S1+0S2+MR1+MR2+MR3
Using the Big M-Method the initial tableau will be
1 | Cj | 2500 | 3000 | 0 | 0 | m | m | M | ||
CB | BV | X1 | X2 | S1 | S2 | R1 | R2 | R3 | ||
M | R1 | 1 | 0 | -1 | 0 | 1 | 0 | 0 | 30 | |
M | R2 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 20 | |
M | R3 | 1 | 1 | 0 | -1 | 0 | 0 | 1 | 60 | |
Zj | 2m | 2m | -m | -m | m | m | m | 110m | ||
Cj-Zj | 2500-2m | 3000-2m | m | m | 0 | 0 | 0 |
Since it is a minimizing problem we pick the most negative Cj-Zj
Entering variable=X2
Departing variable=R2
Pivot=1
Step 4: New optimal solution
Cj | 2500 | 3000 | 0 | 0 | m | M | |||
CB | Bv | X1 | X2 | S1 | S2 | R1 | R3 | Bj | Ratio |
M | R1 | 1 | 0 | -1 | 0 | 1 | 0 | 30 | 30 |
3000 | X2 | 0 | 1 | 0 | 0 | 0 | 0 | 20 | 0 |
m | R3 | 1 | 0 | 0 | -1 | 0 | 1 | 40 | 40 |
Zj | 2m | 0 | -m | -m | m | M | 70m+60,000 | ||
Cj-Zj | 2500-2m | 0 | m | m | 0 | 0 |
The solution is not optimal and feasible. We pick most negative Cj-Zj. Entering=X1, departing R1 and pivot=1
Step 5: New optimal solution
Cj | 2500 | 3000 | 0 | 0 | M | ||
CB | BV | X1 | X2 | S1 | S2 | R3 | Bj |
2500 | X1 | 1 | 0 | -1 | 0 | 0 | 30 |
3000 | X2 | 0 | 1 | 0 | 0 | 0 | 20 |
m | R3 | 0 | 0 | 1 | -1 | 1 | 10 |
Zj | 2500 | 3000 | -2500+m | -m | m | 135000+110m | |
Cj-Zj | 0 | 0 | 2500-m | m | M |
The solution is optimal but not feasible. Pick the most negative Cj-Zj
Entering=S1
Departing=R3
Pivot=1
Step 6:
Cj | 2500 | 3000 | 0 | 0 | ||
CB | BV | X1 | X2 | S1 | S2 | |
2500 | X1 | 1 | 0 | 0 | -1 | 40 |
3000 | X2 | 0 | 1 | 0 | 0 | 20 |
0 | S1 | 0 | 0 | 1 | -1 | 10 |
Zj | 2500 | 3000 | 0 | -2500 | 160, 000 | |
Cj-Zj | 0 | 0 | 0 | 2500 |
Optimality has been achieved
Feasible solution
X1=40
X2=20
S1=10
Min Z=$160, 000
Conclusion: There should be 40 undergraduates’ course and 20 graduate courses to be offered in the college.
Delivering a high-quality product at a reasonable price is not enough anymore.
That’s why we have developed 5 beneficial guarantees that will make your experience with our service enjoyable, easy, and safe.
You have to be 100% sure of the quality of your product to give a money-back guarantee. This describes us perfectly. Make sure that this guarantee is totally transparent.
Read moreEach paper is composed from scratch, according to your instructions. It is then checked by our plagiarism-detection software. There is no gap where plagiarism could squeeze in.
Read moreThanks to our free revisions, there is no way for you to be unsatisfied. We will work on your paper until you are completely happy with the result.
Read moreYour email is safe, as we store it according to international data protection rules. Your bank details are secure, as we use only reliable payment systems.
Read moreBy sending us your money, you buy the service we provide. Check out our terms and conditions if you prefer business talks to be laid out in official language.
Read more