“…The programming is feasible, and (3,4,6) is an initial basis that corresponds to efficient solution x 0 = (0, 0, 1/6, 5/6, 0, 0, 2/3), which is C = (3,4,6). The objective value of e T s − can still be improved by pivoting to an adjacent basis (4,5,6) that corresponds to efficient solution x 1 = (0, 0, 0, 3/4, 1/4, 0, 0), where e T s − = 0. Thus, we have reached to an optimal solution with β 1 = (4, 17/4).…”