b0bc6e31faf2ef92094f4820bec97d8460129d7c,scipy/optimize/_linprog_rs.py,,_get_more_basis_columns,#Any#Any#,75

Before Change

    B[:, 0:len(basis)] = A[:, basis]
    rank = 0  // just enter the loop

    while rank < m:
        // permute the options, and take as many as needed
        new_basis = np.random.permutation(options)[:m-len(basis)]
        B[:, len(basis):] = A[:, new_basis]  // update the basis matrix
        rank = np.linalg.matrix_rank(B)      // check the rank

    return np.concatenate((basis, new_basis))


def _generate_auxiliary_problem(A, b):

After Change

    B[:, 0:len(basis)] = A[:, basis]
    rank = 0  // just enter the loop

    for i in range(n):  // somewhat arbitrary, but we need another way out
        // permute the options, and take as many as needed
        new_basis = np.random.permutation(options)[:m-len(basis)]
        B[:, len(basis):] = A[:, new_basis]  // update the basis matrix
        rank = np.linalg.matrix_rank(B)      // check the rank
        if rank == m:
            break

    return np.concatenate((basis, new_basis))


def _generate_auxiliary_problem(A, b):

Instances