# A non-degenerate basic feasible solution $(x_1, x_2, x_3, x_4, x_5, x_6)$ is

Consider the following Linear Programming Problem

Min $z=2x_1 + 3x_2 + x_3$

Sub to $x_1 + 2x_2 + 2x_3 - x_4 +x_5=3$

$2x_1 + 3x_2 + 4x_3 + x_6=6$

$x_i\geq 0$, $i=1,......., 6$

A non-degenerate basic feasible solution $(x_1, x_2, x_3, x_4, x_5, x_6)$ is

1) (1, 0, 1, 0, 0, 0)

2) (1, 0, 0, 0, 0, 7)

3) (0, 0, 0, 0, 3, 6)

4) (3, 0, 0, 0, 0, 0)