returns the optimal value of this linear program . concode_field_sep double[][] a concode_elem_sep double EPSILON concode_elem_sep int[] basis concode_elem_sep int M concode_elem_sep int N concode_field_sep void test concode_elem_sep boolean isDualFeasible concode_elem_sep double[] primal concode_elem_sep void show concode_elem_sep int minRatioRule concode_elem_sep void main concode_elem_sep boolean check concode_elem_sep int dantzig concode_elem_sep void test1 concode_elem_sep boolean isOptimal concode_elem_sep void test4 concode_elem_sep boolean isPrimalFeasible concode_elem_sep void test2 concode_elem_sep double[] dual concode_elem_sep void test3 concode_elem_sep void solve concode_elem_sep void pivot concode_elem_sep int bland
double function ( ) { return - a [ M ] [ M + N ] ; }