X1.x2 Subject to 4x1-3x2 S 20 x1 +2x2 s 10 a) Is this problem convex? Justify your answer. (5 Poi...
(45 Points) Consider the constrained optimization problem: min f(x1, x2) = 2x} + 9x2 + 9x2 - 6x1x2 – 18x1 X1 X2 Subject to 4x1 – 3x2 s 20 X1 + 2x2 < 10 -X1 < 0, - x2 < 0 a) Is this problem convex? Justify your answer. (5 Points) b) Form the Lagrange function. (5 Points) c) Formulate KKT conditions. (10 Points) d) Recall that one technique for finding roots of KKT condition is to check all permutations...
[4.37] Consider the following problem: Maximize 2x + 3x2 subject to X1 + 2x2 5 10 -*1 + 2x2 s 6 *1 + *2 S6 12 0. a. c. X1, Solve the problem graphically and verify that the optimal point is a degenerate basic feasible solution. b. Solve the problem by the simplex method. From Part (a), identify the constraint that causes degeneracy and resolve the problem after deleting this constraint. Note that degeneracy disappears and the same optimal solution...
1. Consider the constrained optimization problem: min f(x,x2) - (x-3)2 (x2 -3)2 Subject to Is this problem convex? Justify your answer Form the Lagrangian function. a. b. Check the necessary and sufficient conditions for candidate local minimum points. Note that equality constraint for a feasible point is always an active constraint c. d. Is the solution you found in part (c) a global minimum? Explain your answer
6, Maximize z = 2x1 + x2 + 3x3 subject to x 3x2 5x3 s 10 2x x 20, x, 0, x320. (a) State the dual problem. (b) Solve both the primal and the dual problem with any method that works. (c) Check that your optimal solutions are correct by verifying they are feasible and the primal and dual objective functions give the same value. 6, Maximize z = 2x1 + x2 + 3x3 subject to x 3x2 5x3 s...
2a. Consider the following problem. Maximize 17-Gri +80 Subject to 5x1 + 2x2 320 i 212 10 and Construct the dual problem for the above primal problem solve both the primal problem and the dual problem graphically. Identify the corner- point feasible (CPF) solutions and comer-point infeasible solutions for both problems. Calculate the objective function values for all these values. Identify the optimal solution for Z. I 피 University 2b. For each of the following linear programming models write down...
Problem 1 (20 pts) Consider the mathematical program max 3x1+x2 +3x3 s.t. 2x1 +x2 + x3 +x2 x1 + 2x2 + 3x3 +2xs 5 2x 2x2 +x3 +3x6-6 Xy X2, X3, X4, Xs, X620 Three feasible solutions ((a) through (c)) are listed below. (0.3, 0.1, 0.4, 0.9, 1.65, 1.6) (c) x Please choose one appropriate interior point from the list, and use the Karmarkar's Method at the interior point and determine the optimal solution. 25 Problem 1 (20 pts) Consider...
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...
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...
QUESTION 1 Given the following LP, answer questions 1-10 Minimize -3x15x2 Subject to: 3x2x 24 2x1+4x2 2 28 2s 6 x1, x2 20 How many extreme points exist in the feasible region for this problem? We cannot tell from the information that is provided The feasible e region is unbounded QUESTION 2 Given the following LP, answer questions 1-10 Minimize 2- 31+5x2 Subject to: 3x2x 24 2x1+4x2228 t is the optimal solution? (2, 6) (0, 12) (5,4.5) None of the...
2. Consider the following four consumers (C1,C2,C3,C4) with the following utility functions: Consumer Utility Function C1 u(x,y) = 2x+2y C2 u(x,y) = x^3/4y^1/4 C3 u(x,y) = min(x,y) C4 u(x,y) = min(4x,3y) On the appropriate graph, draw each consumer’s indifference curves through the following points: (2,2), (4,4), (6,6) and (8,8), AND label the utility level of each curve. Hint: Each grid should have 4 curves on it representing the same preferences but with different utility levels. 3. In the following parts,...