def solve(matrix): matrix = parse_to_fpi(matrix) matrix = put_tableux_form(matrix) base_columns = np.zeros(matrix.shape[0]) canonical_form(matrix,base_columns) dual_simplex(matrix,base_columns)
def solve(matrix): matrix = parse_to_fpi(matrix) matrix = put_tableux_form(matrix) base_columns = np.zeros(matrix.shape[0]) canonical_form(matrix, base_columns) primal_simplex(matrix, base_columns) simplex_tuple = (matrix, base_columns, "optimal" ) #0 - viavel, 1 - ilimitada, 2 ótima return simplex_tuple
def prepare_for_primal_simplex(matrix,original_matrix,base_columns): end_c = matrix.shape[1]-matrix.shape[0]-1 original_matrix = parse_to_fpi(original_matrix) original_matrix = put_tableux_form(original_matrix) original_matrix[1:original_matrix.shape[0], 0:end_c ] = matrix[1:matrix.shape[0], 0:end_c ] original_matrix[1:original_matrix.shape[0], -1 ] = matrix[1:matrix.shape[0], -1] original_matrix = put_canonical_form(original_matrix,base_columns) solve_primal_simplex(original_matrix,base_columns)
def solve(matrix): original_matrix = matrix base_columns = np.zeros(matrix.shape[0]) matrix = parse_to_fpi(matrix) matrix = zero_vector_c(matrix) matrix = put_tableux_form(matrix) matrix = transform_b_positive(matrix) matrix = add_identity_matrix(matrix,matrix.shape[1]-1,matrix.shape[0]-1,1) end_c = matrix.shape[1]-matrix.shape[0] for index in range(1,(matrix.shape[0])): base_columns[index] = end_c end_c = end_c+1 matrix = put_canonical_form(matrix,base_columns) primal_simplex_auxiliar_pl(matrix,base_columns,original_matrix)