Ask Question, Ask an Expert

+61-413 786 465

info@mywordsolution.com

Ask Engineering Mathematics Expert

Solve the following linear programming problem:

MAX 2X1 + 3X2 + 4.5X3 + 5.25X4

4X1 + 5X2 + 6X3 + 7X4 <= 39,000 [1]

X1 + 2X2 + 3X3 +X4<= 26,000 [2]

X1 + X3 + X4 <= 5,500 [3]

X1 + X2 + X3 <= 10,000 [4]

X1 - 0.5X2 = 0 [5]

X1,X2,X3 >=0

What are the optimal solution and the optimal value of the objective function?

Answer the following questions, Only Resolve if necessary,

a) If the profit in variable three is increased by 0.5 units, will this change the optimal solution? If so, what is the new optimal solution? Will this change the optimal value of the objective function? If so, by how much?

b) If the restriction for constraint [1] is reduced to 35000, will this change the optimal solution? Will this change the optimal value of the objective function? If so, by how much?

c) What will be the effect of increasing by 1000 resources to constraint [3]? Will it change the optimal value? Will it change the optimal value of the objective function? If so, by how much?

d) If the profit in variable four is increased by 1.5 units, are there other optimal solutions? Explain why or why not. If there is at least one other solution, find another solution.

e) If the profit in variable two is increased to 4, will this change the optimal solution? If so, what is the new optimal solution? Will this change the optimal value of the objective function? If so, by how much?

Engineering Mathematics, Engineering

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

Priced at Now at $30, Verified Solution

Have any Question?


Related Questions in Engineering Mathematics

Numerical analysis assignment -q1 define the following

Numerical Analysis Assignment - Q1. Define the following terms: (i) Truncation error (ii) Round-off error Q2. Show that if f(x) = logx, then the condition number, c(x) = |1/logx|. Hence show that log x is ill-conditioned ...

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 ...

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.

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 ...

Clculus assignment -q1 find the total differential of w

CALCULUS ASSIGNMENT - Q1. Find the total differential of w = x 3 yz + xy + z + 3 at (x, y, z) = (1, 2, 3). Q2. Find the value of the double integral ∫∫ R (6x + 2y 2 )dA where R = {(x, y)| - 2 ≤ y ≤ 1, y 2 ≤ x ≤ 2 - y. Q3 ...

Question a suppose that you are given an instance of the

Question : (a) Suppose that you are given an instance of the MST problem on a graph G, with edge weights that are all positive and distinct. Let T be the minimum spanning tree for G returned by Kruskal's algorithm. Now s ...

Math assignment -q1 let fx -x3-cosx and p0 1 use newtons

Math Assignment - Q1. Let f(x) = -x 3 -cos(x), and p 0 = 1. Use Newton's method to find p 2 . Could p0=0 be used? Q2. Perform two iterations by Newton's method and the secant method to each of the following: a. e x + 2 - ...

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 ...

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 ...

Analytical methods for engineers assignment - calculusthis

ANALYTICAL METHODS FOR ENGINEERS ASSIGNMENT - CALCULUS This assignment assesses Outcome - Analyse and model engineering situations and solve problems using calculus. Questions - Q1. Differentiate the following functions ...

  • 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