(ECE580_AC3_2017_question1) |
|||
| Line 1: | Line 1: | ||
| − | [[Category:ECE | + | [[Category:ECE]] |
| + | [[Category:QE]] | ||
| + | [[Category:CNSIP]] | ||
| + | [[Category:problem solving]] | ||
| + | [[Category:automatic control]] | ||
| + | [[Category:optimization]] | ||
| − | = | + | <center> |
| + | <font size= 4> | ||
| + | [[ECE_PhD_Qualifying_Exams|ECE Ph.D. Qualifying Exam]] | ||
| + | </font size> | ||
| + | <font size= 4> | ||
| + | Automatic Control (AC) | ||
| + | Question 3: Optimization | ||
| + | </font size> | ||
| − | + | August 2017 | |
| + | </center> | ||
| + | ---- | ||
| + | ---- | ||
| + | :Student answers and discussions for [[QE2013_AC-3_ECE580-1|Part 1]],[[QE2013_AC-3_ECE580-2|2]],[[QE2013_AC-3_ECE580-3|3]],[[QE2013_AC-3_ECE580-4|4]],[[QE2013_AC-3_ECE580-5|5]] | ||
| + | ---- | ||
| + | 1.(20 pts) Considern the following linear program, minimize <math>2x_{1} + x_{2}</math>, subject to <br/> | ||
| + | <math>x_{1} + 3x_{2} \geq 6 </math> <br/> | ||
| + | <math>2x_{1} + x_{2} \geq 4</math> <br/> | ||
| + | <math> x_{1} + x_{2} \leq 3 </math> <br/> | ||
| + | <math> x_{1} \geq 0 </math>, <math> x_{2} \geq 0 </math>. <br/> | ||
| + | Convert the above linear program into standard form and find an initial basix feasible solution for the program in shtandar form. <br/> | ||
| + | ---- | ||
| + | 2.(20 pts) | ||
| − | [[ | + | |
| + | [[ECE_PhD_Qualifying_Exams|Back to ECE QE page]] | ||
Revision as of 22:06, 27 January 2019
Automatic Control (AC)
Question 3: Optimization
August 2017
1.(20 pts) Considern the following linear program, minimize $ 2x_{1} + x_{2} $, subject to
$ x_{1} + 3x_{2} \geq 6 $
$ 2x_{1} + x_{2} \geq 4 $
$ x_{1} + x_{2} \leq 3 $
$ x_{1} \geq 0 $, $ x_{2} \geq 0 $.
Convert the above linear program into standard form and find an initial basix feasible solution for the program in shtandar form.
2.(20 pts)
