Question

16.10 Consider the linear programming problem minimze -T subject to 1-2-1 T1,2 20 a. Write down the basic feasible solution for z as a basic variable. b. Compute the canonical augmented matrix corresponding to the basis in part a c. If we apply the simplex algorithm to this problem, under what circum stance does it terminate? (In other words, which stopping criterion in the simplex algorithm is satisfied?) d. Show that in this problem, the objective function can take arbitrarily negative values over the constraint set

Answer 1

Gtiven 나near Proground ry Problem Standard form manz"= ; Subject to o4_%, 叫)》, o け%lts taken ag basic fe0A bl e Solution , then His vafue form of Lpp s Tha matt ryc Ol The md is

O The starting simplen table s --ко , so that χ21stne in cominar vector épto tne baets anf nto the bans an ) Comin r f忆om the %) is the outgoing, vecto b aets to that Lpp hoy n bounded solutior objective functior 7S to uwhen x qoes tor