Question

In: Statistics and Probability

Suppose an optimization problem is trying to minimize the cost function : Cost = 7S +...

Suppose an optimization problem is trying to minimize the cost function : Cost = 7S + 10R.   The company is producing two products, product S and product R, subject to the following constraints:

                                S + R ≤ 90

                        3S + 10R ≥ 620

                        R ≤ 100

                        S ≥ 20

                        S, R ≥ 0

Program this into a blank Excel worksheet and use Solver to find the solution for S and R such that the objective function is minimized.

Can you please explain how to do that in excel ? I need the process . I don't really need the handwritten format .I just need to understns how to do that in excel .

Solutions

Expert Solution

Final Answer : S=20 , R=56

Part 1 : Constructing the sheet to specify the whole LP problem formulation

1. Create Two column headings : each for S and R , name them "S" and "R" respectively . (say we do this in cells : I3 and J3 )

2. In next row, under the column headings, leave blank cells, these are the two cells which will act as place holder for both variables S and R's varying values. (So these will be cells I4 and J4)

3. Then in next row, enter the coefficient of objective function i.e. 7 and 10 in our case. (Cells : I5 , and J5 ; I5 has "7" and J5 has "10" )

4. Now, in cell K5 , we enter the formula : = I4*I5 + J4*J5 ( This will specify the objective function , so if current values in I3 and J3 are zero then this value in K5 will be zero )

5. This step will list down all the constraints one after the other starting from Row 7 i.e. in Row 7, we will have following entries in order to encode the constraint "S+R<=90 "  :

I7 : 1 , J7 : 1 , L7 : =I4*I7 + J4*J7 , M7 : 90

Similarly, other constraints are encoded , so after doing these steps, our sheet will look like :

Part 2: Using Solver to solve the formulated LP in part 1 :

1. Open "Solver" tab under "DATA" ribbon

2. Set Objective : $K$5

By changing variables cells : $I$4:$J$4

3. Subject to constraints : Put appropriate sign <= , >= as needed in respective constraint,

for eg. to add S+R<=90 , choose "Add" button , then in Cell Reference, choose the cell in which the LHS of constrain was coded, so in our example this was cell K7, then choose <= and finally chooce the cell in which RHS of constrain was recorded. i.e. L7 in our case .

then after doing all these, choose : "Solve" , you will get the answers in cell I4, J4, and K5 .

Final Solver window before entering "Solve" button will look like :

Example windows for LP formulations :


Related Solutions

Suppose the optimization problem is to minimize the cost of production c = 3 x +...
Suppose the optimization problem is to minimize the cost of production c = 3 x + 4 y subject to the constraint 2xy =337.5. Here the cost-minimizing amount of x is ?? , and y is ?? . The Lagrange multiplier is ?? . The second principal minor of Bordered Hessian is ?? . The bordered Hessian matrix is??
Solve the following optimization problem. Minimize J = x + 3y + 2z
Solve the following optimization problem. MinimizeJ = x + 3y + 2zsubject to the constraints
Optimization Problem
We want to construct a box whose base length is three times the base width. The material used to build the top and bottom cost $10/ft2 and the material to build the sides cost $6/ft2 . If the box must have volume 50 ft3 , what is the minimum cost of the box?
Solve the following optimization problem (Be sure to include the statement of the optimization problem and...
Solve the following optimization problem (Be sure to include the statement of the optimization problem and a graph of the feasible in your solution): Jamie has joined a building contest. A dog shape requires 3 small blocks and one large block to build. A robot shape requires 5 small bricks and 5 large bricks to build. Jamie has a supply of 240 small bricks and 100 large bricks. If a dog is worth 2 points and a robot is worth...
A business that produces color copies is trying to minimize its average cost per copy​ (total...
A business that produces color copies is trying to minimize its average cost per copy​ (total cost divided by the number of​ copies). This average cost in cents is given by ​f(x)equals=0.00000093x^2−0.0146+60​, where x represents the total number of copies produced. ​(a) Describe the graph of f. ​(b) Find the minimum average cost per copy and the corresponding number of copies made.
Consider the optimization problem of the objective function f(x, y) = 3x 2 − 4y 2...
Consider the optimization problem of the objective function f(x, y) = 3x 2 − 4y 2 + xy − 5 subject to x − 2y + 7 = 0. 1. Write down the Lagrangian function and the first-order conditions. 1 mark 2. Determine the stationary point. 2 marks 3. Does the stationary point represent a maximum or a minimum? Justify your answer.
Solve the optimization problem for a Cobb-Douglas utility function with three goods: U(x1, x2, x3) =...
Solve the optimization problem for a Cobb-Douglas utility function with three goods: U(x1, x2, x3) = x c 1x d 2x f 3 , where c, d, f > 0.
Explain the concept of optimization. Explain the general procedure used to do an optimization problem. Use...
Explain the concept of optimization. Explain the general procedure used to do an optimization problem. Use an example and include steps
Question 3: Graphically solve the following problem. Minimize the cost = X + 2 Y Subject...
Question 3: Graphically solve the following problem. Minimize the cost = X + 2 Y Subject to:      X+3Y  >=  90                         8X + 2Y >= 160                         3X + 2Y >= 120                         Y  <=   70                         X,Y  >=  0   What is the optimal solution? Change the right hand side of constraint 2 to 140 (instead of 160) and resolve the problem. What is the new optimal solution?
The Knapsack problem is an optimization problem that asks to fill a knapsack with maximum possible...
The Knapsack problem is an optimization problem that asks to fill a knapsack with maximum possible value. Using greedy paradigm, we can solve this problem easily. Your task is the following: (a) Write the pseudo-code of a greedy solution for knapsack problem. (b) Give is the time complexity of your solution in part (a). (c) Implement part (a) in C programming language.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT