A spreadsheet model for the problem and solve it using solver.

Question

Want to see the full answer?

Answer 1

Question

Chapter 3, Problem 12QP

Summary Introduction

To develop: A spreadsheet model for the problem and solve it using solver.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Answer the given question with a proper explanation and step-by-step solution. Consider the following optimization problemMinimize 3x1+8x2s.t.2x1+6x2 > 6x1+2x2 > 2.5x1+3x2 > 0.5x1>0 x2>0a) Graph the feasible region of this linear program. Is the feasible region bounded?Why? (you may use an online tool like desmos.com/calculator)b) Are any of the above constraints redundant? If so, indicate which one(s). Explainwhy.c) Solve the linear program using the graphical method. Explain your approach.d) Consider the feasible region drawn in Part (a) and answer the following: If we addthe constraint 3x1+x2> a (hint: you may use desmos.com/calculator and shift theparameter a to see how the feasible region changes)i. For what values of a is this a redundant constraint, if any? Why?ii. For what values of a is the above optimal solution no longer optimal, ifany? Why?iii. For what values of a does the problem become infeasible, if any? Why?e) Consider the original formulation…

Consider the following all-integer linear program: Max 5x1 + 8x2 s.t. 6x1 + 5x2 ≤ 28 11x1 + 5x2 ≤ 46 x1 + 2x2 ≤ 8 x1, x2 ≥ 0 and integer Find the optimal solution to the LP Relaxation. If required, round your answers to two decimal places. x1= fill in the blank 2 x2= fill in the blank 3 Optimal Solution to the LP Relaxation fill in the blank 4 Round down to find a feasible integer solution. If your answer is zero enter “0”. x1= fill in the blank 5 x2= fill in the blank 6 Feasible integer solution fill in the blank 7 Find the optimal integer solution. If your answer is zero enter “0”. x1= fill in the blank 8 x2= fill in the blank 9 Optimal Integer Solution fill in the blank 10 Is it the same as the solution obtained in part (b) by rounding down?

Assignment Problem: An iron & steel plant company has 4 machines available for assignment to 4 tasks in one of its production lines. Any machine can be assigned to any task, and each task requires processing by one machine. The time required to set up each machine for the processing of each task is given in the table below. (a) Formulate an assignment problem that could be used to determine how to minimize the total setup time needed for the processing of all four tasks. The formulation should be in algebraic closed form. (b) Use LINGO/OPL/EXCEL to solve your model. Write down the results of the decision variables and the objective function. Explain the value of the decision variables. What do they mean? (You can code your model either in the open form or in the closed form, it depends on you). (c) Use the Hungarian method to solve the problem. Find the optimal assignment and the total setup time required.