I want to put my answer for anyone who comes across this post and wants to use @copper-hat 's suggestion. Auto Lab Software Download more. What I did was to transfer the problem over to terms of $ lambda$ and then prove that $ lambda$ is unbounded which is sort of what MargG did. So let us choose $x_0 = (2, 0)^T$ for our feasible solution point. Jim Stengel Grow Ebookers. Then we can clearly see (from the picture above) that in the direction parallel, to the $x-axis$ the problem is unbounded.

1 The Dual of Linear Program. For bounded and feasible linear programs, there is always a dual solution that certi es the exact value of the optimum. Solving Linear Programming Problems – The Graphical Method 1. A bounded set is a set that has a boundary around the feasible set. A linear programming.

Therefore we choose the direction $d_0 = (1,0)^T$ and so we can build a parametric line going to the right parallel to the x-axis. Softtech Spirit Crackle. In other words we map the problem to the parametric line for which $ lambda$ should be bounded: $ Rightarrow (x_1,x_2)^T mapsto x_0 + lambda d_0$ $ Rightarrow (x_1,x_2)^T mapsto (2,0)^T + lambda (1,0)^T$ Therefore $x_1 = 2 + lambda$ $x_2 = 0$ Substituing into our original problem we are left with: Max: $2 + lambda$ Constraints: $−2(2+ lambda ) leq −1$ $−(2+ lambda) leq −2$ After we pass $ lambda$ on one side we get: $ lambda geq -3/2$ $ lambda geq 0$ which of course means the problem is unbounded from above.

Linear Programming for Optimization Mark A. Linear programming is the name of a. Can solve virtually any bounded, feasible linear programming problem of.