Question

2 6, 9、19/ 1,12 '12,13,16,16, 16,18,3‘ = 12.5 4 IQR=46 Question #1 (15 Marks) a) (8 Marks) Answer the following questions with True or False. 1) Every basic solution in the assignment problem is necessarily degenerate. 2) The assignment problem cannot be solved using the transportation technique. maximum or minimum. If a single-variable function has two local minima, it must have at least one local 4) maximum. 5) The Golden Section Search method gives better results than the Fibanocci Search method. 6) If we use the Fibanocci Search method to find the value of x that minimize the function f(x)-x +4cos(x) value of x to within a range of 0.2, then 3 iterations are needed to obtain the in the interval [1, 2] and we want to locate the solution. The Newton Method gives less accurate results than the Secant Method. 7) An assignment problem can be formulated as a linear programming problem, it is solved by special method known as the Hungarian method. 8) b) (3 Marks) Write a MATLAB m-file to solve the following problem, maximize Z = 3x,-2x, + 5x,-4x, xx 21 4-х,21 subject to 20, Х,20. 20, Х, 20,

Answer 1

desenaat 2-\false, techwywa.dutid uuapa.wm 형.uwung t anaratati n falor