

dont solve it by excel please Question 3: Problem Solving (10 Marks) We propose the following...
Question 1: Problem solving (3 Marks) Therma-Pro is company specialized in selling thermal sensors. The company analysts "team is attempting to find the best forecast for the month 5 demand. The company data on historical monthly demand is presented in the following table: Months Monthly Demand 2 3 4 $3000 $4500 $3000 $5500 5 Question: Compute the forecast value of the thermal sensors demand for month 5, assuming that F2=$5500 and a=0.2. Question 2: Problem Solving (8 Marks) We propose...
Question 1 - Revised Simplex Algorithm 10 marks Suppose we are solving the following linear programming problem Subject to 8x1 + 12x2 + x3 15x2 + x4 3x1 + 6x2 + X5 -120 60 = 48 x1,x2,x3, x4,x5 2 0 Assume we have a current basis of x2,xz, x5. Demonstrate your understanding of the steps of the Revised Simplex Algorithm by answering the following: a) What is the basic feasible solution at this stage? What is the value of the...
Question #1 (15 Marks) a) (8 Marks) Answer the following questions with True or False. 1) 2) 3) Every basic solution in the assignment problem is necessarily degenerate. The assignment problem cannot be solved using the transportation technique. If the gradient vector of a function at a given point is zero, the point can only be a maximum or minimum. If a single-variable function has two local minima, it must have at least one local 4) maximum 5) The Golden...
SOLVE THE FOLLOWING 2 LINEAR PROGRAMMING PROBLEMS USING EXCEL AND THE SOLVER ADD-IN. PROBLEM #1: Maximize Z = $60X + $90Y Subject to: 60X + 30Y >= 1,500 100X + 100Y <= 6,000 Y >= 30 X, Y >= 0 PROBLEM #2: Minimize Z = $3,000X + $1,000Y Subject to: 60X + 20Y >= 1,200 10X + 10Y >= 400 40X + 160Y >= 2,400 ...
please step by step
Question 2: (20 Marks) A) Explain and discuss with examples the stages of development of Operational research? B) Solve the following linear programming problem graphically: z = 10x+15 Subject to : 3x+6x, 560 Max X: + xy S 16 * 20 C) Discuss and explain the aim and the steps of the ?stepping stone methods of the transportation problems (Question 3: (20 Marks A) Find the starting basic feasible solution for the following Table by using...
QUESTION 3 Given this problem: Max Z = $0.3x + $0.90y Subject to: 2x + 3.2y <= 160 4x + 2.0y <= 240 y <= 40 X, y >=0 a) Solve for the quantities of x and y which will maximize Z. The x = The y = b) What is the maximum value of Z? The Z=
Please answer both
4. 0-2 points TanFin1 14.1.022 Solve the linear programming problem by the simplex method. Maximize P 12x + 9y subject to x+ys 12 3x ys 30 10x + 7y 70 x 20, y 20 The maximum is P at (x, y)- Submit Answer Save Progress 5. -12 points TanFin11 4.1.028. Solve the linear programming problem by the simplex method. Maximize P2z subject to 2x y + zs 12 4x +2y 3z s 24 2x + 5y 5z...
Solve the following linear programming models graphically and explain the solution results based on the different solution types we discussed in class. a) Formulation 1 Subiect to: AX 12 X,Y 20 b) Formulation 2 Max Z = X + 4Y Subject to: 2X +3Y 3 24 Y 2 1 X,Y 2 0 c) Formulation 3 Subject to: X 2 4 6X 6Y 2 42 Y 2 2
Solve the following linear programming models graphically and explain the solution results based...
please Solve the question with excel solver
Solve the question with excel solver
URBAN PLANNING - URBAN RENEWAL MODEL Example 2.4.6 on page 70 of Taha's book Decision variables: XI-Number of units of single-family homes x2 - Number of units of double-family homes x3 = Number of units of triple-family homes x4 - Number of units of quadruple-family homes xs = Number of old homes to be demolished XS Maximize z=1000 x1 + 1900 x2 +2700 x3 +3400 x4 Subject...
1. Solving the linear programming problem Maximize z 3r1 2r2 3, subject to the constraints using the simplex algorithm gave the final tableau T4 T5 #210 1-1/4 3/8-1/812 0 0 23/4 3/8 7/8 10 (a) (3 points) Add the constraint -221 to the final tableau and use the dual simplex algorithm to find a new optimal solution. (b) (3 points) After adding the constraint of Part (a), what happens to the optimal solution if we add the fourth constraint 2+...