IND ENG 162 Midterm: ieor162-sp2007-mt1-Zhang-soln
8 Jan 2019
School
Course
Professor
Document Summary
The problem could be unbounded, in which case x is not an optimal solution: false. The correct statement is x is a basic feasible solution if and only if x is an extreme point: false. Consider the lp max{x1 + x2 : x1 + x2 2, x1, x2 0}, for which the following two points are feasible: x1 = (2, 0) and x2 = (0, 2). Now let = 2, then x1 + (1 )x2 = (4, 0) (0, 2) = (4, 2), which is clearly not a feasible solution: false. At each iteration of the simplex method, it is possible for all of the basic variables" values to change as well as one non-basic variable. 3 , s1, e2, s3 0 x1, x2, x+ To implement the simplex method using tableaus from a speci ed starting basis, we need to construct the initial tableau. Compute the reduced costs using the familiar formula cn = cn cba 1.
