3-4-5 refer to the tollowing problem and its complete solution. probs. Max. Z . 4x1 + 6x2 + 3x3 + x. 4x1 + x2...
Probs. 3-4-5 refer to the following problem and its complete solution Max . Z 4x1 + 6x2 + 3x3 + x+ ?2x1 + 2x2 + 4x3 + 3x+ 550 (x5) 2x1 + 3x2 + x3 + 2x‘ S 20O (x7) R.S 4-6 -31 /4 3 1 550 700 200 0 o1 3 o 2 Z O 400 2/11 1/12/10 o 1/11 662 / ง 9 525 2 /20 425 2/ 25 1/2-1/10 13/20 1 0 。 3a. Read off the...
z= 4x Max 6*2 3x3 (x,) () (x,) 3x 550 2x2 2x 4x3 + + + 1 x 700 + 4x + 2 2x 200 3x2 + + 3 2x x. + R.S. 6 Eq.# 2 2 B.V. C -1 -3 -6 4 1 550 C O 1 3 2 /2 1 700 1 1 2 4 2 200 1 2 1 3 2 O 3 400 2 C O -1 1 4162/3 2/3 5/3 O 1 1 4/s O...
iu [5 marks]b ii)) Consider the function, f, as the followings,vRuǐ (x1, x2)-5xỈ + x-. + 4x1 x2-14x1-6x2 + 20 ( !0% x») This function has its optimal solution atx"= (1,1) and f(1, 1) 10. Run the k-th iterates of the Newton algorithm, and compute the descend the k-th iteration (dk). [5 marks] Resource Allocation prob iu [5 marks]b ii)) Consider the function, f, as the followings,vRuǐ (x1, x2)-5xỈ + x-. + 4x1 x2-14x1-6x2 + 20 ( !0% x») This...
(b) A LP model and its solution outputs and sensitivity report are as below. LP Model: Maximise R 7X+5Y+10 Z Subjective to: CI: 2X +Y+32 <= 50 C3: X 3 C6: X, Y, Z)so Outputs & Sensitivity Report: Objective Cell Name Valu 101.33 SC$8 Max Variable Cells Final Value ReducedObjective Allowable Allowable Coefficient Increase Cell Name Cost Decrease 7.333333333 SC$3 X 0 E+30 SC$4 Y 0 5 4.333333333 E+30 SC$5 2 4 0 10 1.666666667 E+30 Constraints Final Value Shadow...
This is question 5.3-5 from Introduction to Operations Research (Hillier). Relevant text: Consider the following problem. Maximize Z= cixi + c2x2 + C3X3 subject to x1 + 2x2 + x3 = b 2x1 + x2 + 3x3 = 2b and x 20, X220, X2 > 0. Note that values have not been assigned to the coefficients in the objective function (C1, C2, C3). and that the only specification for the right-hand side of the functional constraints is that the second...