returns the optimal primal solution to 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 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 concode_elem_sep double value
double [ ] function ( ) { double [ ] loc0 = new double [ N ] ; for ( int loc1 = 0 ; loc1 < M ; loc1 ++ ) if ( basis [ loc1 ] < N ) loc0 [ basis [ loc1 ] ] = a [ loc1 ] [ M + N ] ; return loc0 ; }