17 Jul Simplex Tableu and Sensitivity analysis
1. Consider the following problem:
Max Z = 5×1 + 4×2 + 3×3
s.t. x1 + x3 <= 6 2×2 + x3 <= 6 x1, x2, x3 >= 0
(a) Construct the dual for this problem and solve it graphically.
(b) Use the solution in part (a) to identify the shadow prices for the resources in the primal problem.
(c) Confirm your results by solving the original problem using the simplex method and identifying the shadow prices from the final tableau.
2. Solve one iteration of the following problem using the interior-point algorithm starting with an initial trial solution of (4, 1, 0) and alpha = 0.5.
Max Z = 2×1 + 5×2 + 8×3
s.t. x1 + 2×2 + 3×3 = 6
x1, x2, x3 ≥ 0
What is the new solution (x1, x2, x3, and Z), and how much does Z improve from the initial trial solution given above?
3. Given the following original problem:
max Z = 3×1 + 2×2 + x3
s.t. 4×1 + x2 + x3 <= 30 2×1 + 3×2 + x3 <= 60 x1 + 2×2 + 3×3 <= 40
x1, x2, x3 >= 0
Answer the following questions given only the following information from SOME ITERATION of the simplex tableau, with s4, s5, and s6 representing the slack variables for constraints 1, 2, and 3, respectively.
Basic Z x1 x2 x3 s4 s5 s6 RHS
Z
x1 0.25 0 0
s5 -0.5 1 0
(a) What is the optimal solution (Z, x1, x2, x3)? 10 pts
(1) What is the allowable range for b1 (originally 30) for this solution to stay optimal? 5 pts
(II) Evaluate your solution if the coefficients for x3 change to 5 in the objective function, 2 in the first constraint, 4 in the second constraint, and 3 in the third constraint. 5 pts
(III) Write the dual for the original problem. 5 pts
(IIII) Solve the dual and give the optimal solution (y0, y1, y2, y3). 5 pts
(IIIII) Using the original problem, if a new constraint enters the analysis with 2×1+ 3×2 + 5×3 <= 40, would the current solution still be feasible and optimal? 5 pts
(….) Using the original problem, if a new variable enters the analysis (say x8), with c8 = 5, a18 = 3, a28 = 2, and a38 = 1, would the current solution remain feasible and optimal? 5 pts
(…..) What is the allowable range for c2 in the objective function for the current solution to remain optimal? 5 pts
1
1
9
Our website has a team of professional writers who can help you write any of your homework. They will write your papers from scratch. We also have a team of editors just to make sure all papers are of HIGH QUALITY & PLAGIARISM FREE. To make an Order you only need to click Ask A Question and we will direct you to our Order Page at WriteDemy. Then fill Our Order Form with all your assignment instructions. Select your deadline and pay for your paper. You will get it few hours before your set deadline.
Fill in all the assignment paper details that are required in the order form with the standard information being the page count, deadline, academic level and type of paper. It is advisable to have this information at hand so that you can quickly fill in the necessary information needed in the form for the essay writer to be immediately assigned to your writing project. Make payment for the custom essay order to enable us to assign a suitable writer to your order. Payments are made through Paypal on a secured billing page. Finally, sit back and relax.
About Writedemy
We are a professional paper writing website. If you have searched a question and bumped into our website just know you are in the right place to get help in your coursework. We offer HIGH QUALITY & PLAGIARISM FREE Papers.
How It Works
To make an Order you only need to click on “Order Now” and we will direct you to our Order Page. Fill Our Order Form with all your assignment instructions. Select your deadline and pay for your paper. You will get it few hours before your set deadline.
Are there Discounts?
All new clients are eligible for 20% off in their first Order. Our payment method is safe and secure.