examples3 - max 3 x 1 x 2 s.t x 1 x 2 ≥ 3 2 x 1 x 2 ≤ 4...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
IE521 Advanced Optimization Example Set 3 Fall 2011 1. Consider the tableau given below for a maximization problem. Give conditions on the unknowns a 1 ,a 2 ,a 3 ,b,c that make the following statements true. 10 - c 2 0 0 0 4 -1 a 1 1 0 0 1 a 2 -4 0 1 0 b a 3 3 0 0 1 (a) Current solution is optimal. (b) The current solution is optimal and there are alternative optimal solutions. (c) The LP is unbounded (assume b 0). 2. Consider the tableau given below for a maximization problem. Give conditions on the unknowns a 1 ,a 2 ,a 3 ,b,c 1 ,c 2 that make the following statements true. 10 c 1 c 2 0 0 0 0 b 4 a 1 1 0 a 2 0 2 -1 -5 0 1 -1 0 3 a 3 -3 0 0 -4 1 (a) The current solution is optimal and there are alternative optimal solutions. (b) The current solution is not a basic feasible solution. (c) The current solution is a degenerate basic feasible solution. (d) The current solution is feasible, but the LP is unbounded. (e) The current basic solution is feasible, but the objective function value can be improved by replacing x 6 as basic variable with x 1 . 3. Solve the following LP using 2 phase simplex method. min 2 x 1 + 3 x 2 s.t. 2 x 1 + x 2 4 x 1 - x 2 ≥ - 1 x 1 ,x 2 0 1
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
4. solve the following LP using big M method.
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: max 3 x 1 + x 2 s.t. x 1 + x 2 ≥ 3 2 x 1 + x 2 ≤ 4 x 1 + x 2 = 3 x 1 ,x 2 ≥ 5. Find the inverse of the following matrix using row operations: B = ± 0 3 2 1 ² 6. Recall that every LP can have one of the following: Case 1. The LP has a unique optimal solution. Case 2. The LP has alternative or multiple optimal solutions. Two or more extreme points are optimal and the LP will have an infinite number of optimal solutions. Case 3. The LP is infeasible. Case 4. The LP is unbounded (the feasible region is not empty). Identify which of Cases 1-4 apply to each of the following LPs: (a) max x 1 + x 2 s.t. x 1 + x 2 ≤ 4 x 1-x 2 ≥ 5 x 1 ,x 2 ≥ (b) max 4 x 1 + x 2 s.t. 8 x 1 + 2 x 2 ≤ 16 5 x 1 + 2 x 2 ≤ 12 x 1 ,x 2 ≥ (c) max-x 1 + 3 x 2 s.t. x 1-x 2 ≤ 4 x 1 + 2 x 2 ≥ 4 x 1 ,x 2 ≥ (d) max 3 x 1 + x 2 s.t. 2 x 1 + x 2 ≤ 6 x 1 + 3 x 2 ≤ 9 x 1 ,x 2 ≥ 2...
View Full Document

{[ snackBarMessage ]}

Page1 / 2

examples3 - max 3 x 1 x 2 s.t x 1 x 2 ≥ 3 2 x 1 x 2 ≤ 4...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online