Optimization - Final Exam Problems | MATH 0164, Exams of Optimization Techniques in Engineering

Material Type: Exam; Class: OPTIMIZATION; Subject: Mathematics; University: University of California - Los Angeles; Term: Unknown 1989;

Typology: Exams

Pre 2010

Uploaded on 08/30/2009

koofers-user-06d
koofers-user-06d 🇺🇸

10 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Math 164/2 Comments:
- Reminder: Final Exam on Monday, March 20, time 3-6pm, room MS 5137.
- Sample problems for the final with solutions are posted on the class webpage. - Office
Hours with the instructor before the final: Thursday 5pm, Friday 2-3pm (and at 5pm),
Sunday 12-2pm (please note that I will not be able to hold regular office hour on Wednesday),
and probably Monday before the final.
- Last homework due on Friday or on Monday.
- When you apply the Complementary Slackness Thm. 6.3, page 154, Chapter 6, make
sure that the primal problem is in standard form.
- Problems 6 and 8 from the sample final problems are examples from Section 14.5.
Hints for the last homework #9:
Problem [2] I want you to use the general method (Lemmas 14.1 and 14.2), using a
basis matrix Zof the null-space of A(and not the more “naive” method where we could
express x3= 3 (2x1+ 5x2+x3) to obtain an unconstrained problem; this method works
in this case too, but I want you to learn the general method introduced in Section 14.2).
Recall that xis a stationary point for problem [2] if Ax =band if ZTf(x) = ~
0 (or
equivalently, if Ax =band if f(x) = ATλfor some vector λ). Here A= [2 5 1] M(1×3),
AT M(3 ×1) and λis a scalar (or vector with just one component).
Problem [3] You do not need to change the maximization problem into a minimization
problem. You have to find local maximizers. Apply Lemma 14.2, page 431, with “negative
definite” instead of “positive definite”. First you need to find all stationary points, then see
which ones are local maximizers, if any.
Here A= [ 1
a1
1
a2
1
a3] M(1 ×3) and b= 1. To find the stationary points first, find Z
as a 3 ×2 matrix, then find all x= (x1, x2, x3)Tsuch that
(x1
a1+x2
a2+x3
a3= 1
ZTf(x) = ~
0,(1)
System (1) has 3 equations and 3 unknows x1, x2, x3. You will show that all possible so-
lutions of the system are x= ( a1
3,a2
3,a3
3)T,x= (0,0, a3)T,x= (0, a2,0)Tand x= (a1,0,0)T.
For each of the 4 points found, compute ZT2f(x)Z(a 2 ×2 matrix) and see if it is
negative definite. Since the problem has some symmetry, it is sufficient to test for the first
point and for one of the last 3 points only.
You will obtain that the first point (a1
3,a2
3,a3
3)Tis a local maximizer (the 2 ×2 matrix
ZT2f(x)Zcan be transformed into an upper triangular matrix with all entries on the
diagonal negative, so ZT2f(x)Zwill be negative definite). The other 3 points are not
local maximizers (the corresponding 2 ×2 matrices ZT2f(x)Zhave one eigenvalue strictly
positive and one eigenvalue strictly negative, therefore ZT2f(x)Zis not negative semi-
definite, so the 2nd order necessary condition for local maximizer is not satisfied).
1
pf2

Partial preview of the text

Download Optimization - Final Exam Problems | MATH 0164 and more Exams Optimization Techniques in Engineering in PDF only on Docsity!

Math 164/2 Comments:

  • Reminder: Final Exam on Monday, March 20, time 3-6pm, room MS 5137.
  • Sample problems for the final with solutions are posted on the class webpage. - Office Hours with the instructor before the final: Thursday 5pm, Friday 2-3pm (and at 5pm), Sunday 12-2pm (please note that I will not be able to hold regular office hour on Wednesday), and probably Monday before the final.
  • Last homework due on Friday or on Monday.
  • When you apply the Complementary Slackness Thm. 6.3, page 154, Chapter 6, make sure that the primal problem is in standard form.
  • Problems 6 and 8 from the sample final problems are examples from Section 14.5.

Hints for the last homework #9: Problem [2] I want you to use the general method (Lemmas 14.1 and 14.2), using a basis matrix Z of the null-space of A (and not the more “naive” method where we could express x 3 = 3 − (2x 1 + 5x 2 + x 3 ) to obtain an unconstrained problem; this method works in this case too, but I want you to learn the general method introduced in Section 14.2). Recall that x is a stationary point for problem [2] if Ax = b and if ZT^ ∇f (x) = ~0 (or equivalently, if Ax = b and if ∇f (x) = AT^ λ for some vector λ). Here A = [2 5 1] ∈ M(1×3), AT^ ∈ M(3 × 1) and λ is a scalar (or vector with just one component).

Problem [3] You do not need to change the maximization problem into a minimization problem. You have to find local maximizers. Apply Lemma 14.2, page 431, with “negative definite” instead of “positive definite”. First you need to find all stationary points, then see which ones are local maximizers, if any. Here A = [ (^) a^11 a^12 a^13 ] ∈ M(1 × 3) and b = 1. To find the stationary points first, find Z

as a 3 × 2 matrix, then find all x = (x 1 , x 2 , x 3 )T^ such that

{ (^) x 1 a 1 +^

x 2 a 2 +^

x 3 a 3 = 1 ZT^ ∇f (x) = ~ 0 ,

System (1) has 3 equations and 3 unknows x 1 , x 2 , x 3. You will show that all possible so- lutions of the system are x = ( a 31 , a 32 , a 33 )T^ , x = (0, 0 , a 3 )T^ , x = (0, a 2 , 0)T^ and x = (a 1 , 0 , 0)T^. For each of the 4 points found, compute ZT^ ∇^2 f (x)Z (a 2 × 2 matrix) and see if it is negative definite. Since the problem has some symmetry, it is sufficient to test for the first point and for one of the last 3 points only. You will obtain that the first point ( a 31 , a 32 , a 33 )T^ is a local maximizer (the 2 × 2 matrix ZT^ ∇^2 f (x)Z can be transformed into an upper triangular matrix with all entries on the diagonal negative, so ZT^ ∇^2 f (x)Z will be negative definite). The other 3 points are not local maximizers (the corresponding 2 × 2 matrices ZT^ ∇^2 f (x)Z have one eigenvalue strictly positive and one eigenvalue strictly negative, therefore ZT^ ∇^2 f (x)Z is not negative semi- definite, so the 2nd order necessary condition for local maximizer is not satisfied).

Problem [4] This can be solved as Example 14.8, page 443, from the textbook. Here again we do not know in advance the candidate points to local minimizers. First write the constraints in the form Ax ≥ b (multiply the second constraint by -1):   

  

  

x 1 x 2 x 3

   ≥

  

  .

There are 3 constraints, A ∈ M(3 × 2), AT^ ∈ M(2 × 3), therefore the full Lagrange multiplier λ has 3 components λ = (λ 1 , λ 2 , λ 3 )T^. Necessary conditions for a point x = (x 1 , x 2 )T^ to be local minimizer are: (1) 2x 1 + x 2 ≥ 2 (2) −x 1 + x 2 ≥ − 1 (3) x 1 ≥ 0 together with ∇f (x) = AT^ λ (two equations that you should write explicitely), λ 1 ≥ 0, λ 2 ≥ 0, λ 3 ≥ 0, and complementary slackness λ 1 (2x 1 + x 2 − 2) = 0, λ 2 (−x 1 + x 2 − (−1)) = 0, λ 3 (x 1 − 0) = 0. To find the solutions of this set of conditions, consider the following cases, and in each case try to find the 5 variables x 1 , x 2 , λ 1 , λ 2 , λ 3 , whenever a solution exists: (i) All three constraints (1), (2), (3) are active (for example this should give you no solutions) (iia) (1) and (2) active, λ 3 = 0 (here you should get x 1 = 1, x 2 = 0, λ 1 = 1/3, λ 2 = − 1 /3, λ 3 = 0, but this will not be a solution because λ 2 < 0). (iib) (1) and (3) active, λ 2 = 0 (iic) (2) and (3) active, λ 1 = 0 (iiia) (1) active, λ 2 = λ 3 = 0 (iiib) (2) active, λ 1 = λ 3 = 0 (iiic) (3) active, λ 1 = λ 2 = 0 (iv) All three constraints are inactive, λ 1 = λ 2 = λ 3 = 0 (for example here you should get (x 1 , x 2 ) = (0, 0) which is not a feasible point, therefore no solution). Finalize the other cases. For the solutions that you obtain, if any, make sure again that the strict complementary slackness holds. Also, for each such point, take Aˆ the submatrix of active constraints at that point, find its corresponding matrix Z and verify the second order conditions: ZT^ ∇^2 f (x)Z positive definite, to obtain the local minimizer(s).