Ask Question, Ask an Expert

+61-413 786 465

info@mywordsolution.com

Ask Engineering Mathematics Expert

Below is a linear programming formulation for a problem with two variables, a and b, and with three constraints, referred to as constraints #1, #2,and #3. Each of the three constraints is a ">=" (greater than or equal to) inequality; the objective is to minimize Z, where the objective function Z is shown in the formulation.

Minimize Z = a + 2b
such that a >= 5 (constraint #1)
b >= 5 (constraint #2)
2a + b >= 20 (constraint #3)
a, b >= 0 (non-negativity constraints)

In this linear programming problem, for the questions that follow: the `solution' refers to the values of the variables, a and b, and the `objective function value' refers to the value of Z at the solution. Please consider each question below as separate from and independent of all others; the changes described are not cumulative. For each change consider it a change to the original problem. Show any work that you can to support your answers.

a. Set up this problem in excel; find the optimal solution using excel solver, and the solution's sensitivity report. What are your solution and your objective function value? For each constraint: what is its shadow price, what is its slack (or, you may call it surplus since these are `>=' constraints), and is it tight (yes or no)?

b. Based on your sensitivity report in part a, what do you anticipate will happen to the solution and objective function value in part a if the right-hand side of constraint #1 goes up by 1? Please be specific.

c. Increase the right-hand side of constraint # 1 by 1 (from 5 to 6) and resolve the problem. What are your solution and your objective function value? Is this consistent with what you anticipated in part b?

d. Based on your sensitivity report in part a, what do you anticipate will happen to the solution and objective function value in part a if the right-hand side of constraint #2 goes up by 1? Please be specific.

e. Return the RHS (right hand side) of constraint 1 to its original value. Increase the right-hand side of constraint # 2 by 1 (from 5 to 6) and resolve the problem. What are your solution and your objective function value? Is this consistent with what you anticipated in part d?

f. Based on your sensitivity report in part a, what do you anticipate will happen to the solution and objective function value in part a if the right-hand side of constraint #3 goes up by 1? Please be specific.

g. Return the RHS (right hand side) of constraint 2 to its original value. Increase the right-hand side of constraint # 3 by 1 (from 20 to 21) and resolve the problem. What are your solution and your objective function value? Is this consistent with what you anticipated in part f?

h. Based on your sensitivity report in part a, what do you anticipate will happen to the solution and objective function value in part a if the right-hand sides of all three constraints go up by 1? Why? Please be specific and show work to support your answer.

i. Increase the right-hand sides of all three constraints by 1 and resolve the problem. What are your solution and your objective function value? Is this consistent with what you anticipated in part h?

Engineering Mathematics, Engineering

  • Category:- Engineering Mathematics
  • Reference No.:- M91629909
  • Price:- $30

Priced at Now at $30, Verified Solution

Have any Question?


Related Questions in Engineering Mathematics

Q undirected vs directed connectivitya prove that in any

Q: Undirected vs. directed connectivity. (a) Prove that in any connected undirected graph G = (V, E) there is a vertex v ? V whose removal leaves G connected. (Hint: Consider the DFS search tree for G.) (b) Give an examp ...

Question 1 - many spas many componentsconsider 4 types of

Question 1 - Many spas, many components Consider 4 types of spa tub: Aqua-Spa (or FirstSpa, or P1), Hydro-Lux (or SecondSpa, or P2), ThirdSpa (or P3) and FourthSpa (or P4), with the production of products P1, ..., P4 in ...

Question suppose that g is a directed graph in class we

Question : Suppose that G is a directed graph. In class we discussed an algorithm that will determine whether a given vertex can reach every other vertex in the graph (this is the 1-to-many reachability problem). Conside ...

Problem 1given a sequence xn for 0lenle3 where x0 1 x1 1

Problem # 1: Given a sequence x(n) for 0≤n≤3, where x(0) = 1, x(1) = 1, x(2) = -1, and x(3) = 0, compute its DFT X(k). (Use DFT formula, don't use MATLAB function) Use inverse DFT and apply it on the Fourier components X ...

Assignment - introduction to math programmingdirections

Assignment - Introduction to Math Programming Directions - Formulate a linear programming model for the following description. Include definitions of decision variables, Objective function, and constraints. Augment your ...

Show all your work not just the answerswhen you multiply 21

(SHOW ALL YOUR WORK, not just the answers) When you multiply: 21 x 68 you most likely do: 8x1 + 8x20 + 60x1 + 60x20 = 1, 428 So, there are 4 multiplications and then 3 additions. How long would it take a computer to do t ...

Assignment -1 let t and or 0 1 be a boolean algebradefine

Assignment - 1. Let (T, ∧, ∨,', 0, 1) be a Boolean Algebra. Define ∗ : T × T → T and o : T × T → T as follows: x ∗ y := (x ∨ y)' x o y := (x ∧ y)' (a) Show, using the laws of Boolean Algebra, how to define x ∗ y using on ...

Assignment - lp problemsthe data for all the problems in

Assignment - LP problems The data for all the problems in this HW are included in the LP_problems_xlsx spreadsheet. Problem 1 - Cash Planning A startup investment project needs money to cover its cash flow needs. At the ...

Problem -consider a closed convex set x sub rd a function h

Problem - Consider a closed convex set X ⊂ R d , a function H : X x Ξ ι→ R d , and a deterministic nonnegative sequence {α n } such that n=0 ∑ ∞ α n = ∞ and n=0 ∑ ∞ (α n ) 2 = ∞. Consider an inner product (·, ·) on R d , ...

Question suppose g is an undirected connected weighted

Question : Suppose G is an undirected, connected, weighted graph such that the edges in G have distinct edge weights. Show that the minimum spanning tree for G is unique.

  • 4,153,160 Questions Asked
  • 13,132 Experts
  • 2,558,936 Questions Answered

Ask Experts for help!!

Looking for Assignment Help?

Start excelling in your Courses, Get help with Assignment

Write us your full requirement for evaluation and you will receive response within 20 minutes turnaround time.

Ask Now Help with Problems, Get a Best Answer

Why might a bank avoid the use of interest rate swaps even

Why might a bank avoid the use of interest rate swaps, even when the institution is exposed to significant interest rate

Describe the difference between zero coupon bonds and

Describe the difference between zero coupon bonds and coupon bonds. Under what conditions will a coupon bond sell at a p

Compute the present value of an annuity of 880 per year

Compute the present value of an annuity of $ 880 per year for 16 years, given a discount rate of 6 percent per annum. As

Compute the present value of an 1150 payment made in ten

Compute the present value of an $1,150 payment made in ten years when the discount rate is 12 percent. (Do not round int

Compute the present value of an annuity of 699 per year

Compute the present value of an annuity of $ 699 per year for 19 years, given a discount rate of 6 percent per annum. As