(5) Consider the problem: minimize I[r(.)] - /r2 dt 0 subject to the conditions x(0)-x()-0 and th...
Consider the problem minimize 1[r(-)] = 2 / r,(t)2 dt subject to the conditions r(0) - r(T)0 and the constraint 0 r(t)2 dt 1. = Suppose that r : [0, π] R is a C2 function that! solves the above Let y : [0, π] R be any other C2 function such that y(0) Define problem a(s): (r(t) + sy(t))2 dt and a(s) a. Explain why a(0) 1 and i'(0) 0. b. Show that i'(0)= | z'(t) y' (t) dt-X...
Consider the optimization problem 5-6 5-6 F=(X-I)2 + (X Minimize: Subject to: 2-1) X +X-0.5s 0 a. Write the expression for the augmented Lagrangian using r'p = 1. b. Beginning with λ 1 0 and λ2-0 , perform three iterations of the ALM method. c. Repeat part (b), beginning with λ 1-1 and λ2-1 d. Repeat part (b), beginning with λι--I and λ2--1
Exercise 7.3. Consider the nonlinearly constrained problem minimize xER2 to (7.1) a x2 1 = 0. subject 1)T is a feasible path for the nonlinear constraint (a) Show that x(a) x x - 1 = 0 of problem (7.1). Compute the tangent to the feasible path at E = (0, 0)7 (sin a, cos a - + X (b) Find another feasible path for the constraint x? + (x2 + 1)2 - 1 = 0. Compute the tangent to the...
LUU UJULIOL Is Luiz: 5 PL Minimize f(x.y) = x2 + xy + y2 subject to y-- 16 without using the method of Lagrange multipliers; instead, solve the constraint for xory and substitute into f(xy). Use the constraint to rewrite f(x,y) = x2 + xy + y2 as a function of one variable, g(x). g(x)0 The minimum value of f(x,y) = x2 + xy + y2 subject to y= - 16 occurs at the point (Type an ordered pair.) The...
(4) Let f R -R be a strictly conve:r C2 function and let 0 a) Write the Euler-Lagrange equation for the minimizer u.(x) of the following problem: minimize u subject to: u E A, where A- 0,REC1[0 , 1and u (0 a u(1)b) b) Assuming the minimizer u(a) is a C2 function, prove t is strictly convex (4) Let f R -R be a strictly conve:r C2 function and let 0 a) Write the Euler-Lagrange equation for the minimizer u.(x)...
[5.53] Consider the problem: Minimize cx subject to Ax = b, x 2 0. Let x* be the unique optimal extreme point. Show that the second best extreme point must be adjacent to x*. What happens if the uniqueness assumption is relaxed?
Must show all work 4. (10 pts) Consider the following problem. Minimize Z=3x2+2 xZ+X3, Maximize subject to subject to (constraint 1) x2+x2=7 (constraint 1) (constraint 2) 3x2+x2+x,210 (constraint 2) (constraint 3) X2-4 x32-8 (constraint 3) (constraint 4) x 21 and (all decision variables nonnegativel and x >0 (no nonnegativity constraint on x.i. (a) (5 pts) Convert this problem to a maximization problem with only three functional constraints, all constraints' RHS are non negative, and all decision variables need to satisfy...
Problem 5. Prove that parametric equations: x a-cosh(s) (a > 0) or back half(a < 0) of hyperboloid of one sheet: Χ t), y b-sinh(s) cos (t) zc-sinh(s) sin( t), (x,y,z) lies on the front half L" a2 b2 c2 Problem 6 What graph of this Compute the arc length : rit)- < sin t, cos t, 2Vt', when 0<t < function: a) Compute the arc length : re)-3cos(9) and 0 < θ < π/2 b) Problem 7. Find parametric...
Consider the following optimization problem: minimize 71 subject tox,- r, where r > 0 is a given scalar 1. Write down the FONC and SONC for this problem. (5 points) 2. Shw ihai whken f is vx, nxxssary conditions a: also sufiint. (10 poimis) Consider the following optimization problem: minimize 71 subject tox,- r, where r > 0 is a given scalar 1. Write down the FONC and SONC for this problem. (5 points) 2. Shw ihai whken f is...