15.093 Optimization Methods Assignment 2 Due October 4 Exercise 2.1 BT Exercise 3.17. This exercise will help you review the simplex method. Exercise 2.2 BT Exercise 3.19. This exercise will help you improve your understanding of the simplex
method.
1
S

15.093J/2.098J Optimization Methods Assignment 1 (100 points) Due September 22
This assignment covers lectures 1,2,3. Exercises 1.1, 1.2, 1.3, 1.4, 1.6 are from the book, denoted at BT, by D. Bertsimas and J. Tsitsiklis, Introduction to Linear Optimizatio

1 15.093J/2.098J Optimization Methods Assignment 3 Solutions Exercise 3.1 BT, Exercise 4.27.
Prove (a) (b)
Consider the problem
min -x1 s.t. Ax 0 x0
For every feasible solution of this problem, x1 = 0. Thus, the problem has a finite optimum and the opti

One of the exercises in this homework has a computational component. You may use any machine and any computer language to execute them. We recommend, however, that you use MATLAB. Some good sources for help on Matlab are: http:/www-math.bgsu.edu/~gwade/ma