Revision as of 12:27, 27 June 2012 by Hu45 (Talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)


ECE Ph.D. Qualifying Exam: Automatic Control (AC)- Question 3, August 2011


 $ \color{blue}\text{2. } \left( \text{20 pts} \right) \text{ Use the simplex method to solve the problem, } $

               $ \text{maximize} x_{1}+x_{2} $

               $ \text{subject to } x_{1}-x_{2}\leq2 $

$ \color{blue}\left( \text{i} \right) \text{ Characterize feasible directions at the point } x^{*}=\left[ \begin{array}{c} \frac{1}{2} \\ 0 \end{array} \right] $

$ \color{blue}\text{Solution 1:} $

Alumni Liaison

Recent Math PhD now doing a post-doctorate at UC Riverside.

Kuei-Nuan Lin