8655560aa19bbde2b5505ed1e8297474f6706872,scipy/optimize/_linprog_rs.py,,_phase_one,#Any#Any#Any#Any#Any#Any#Any#,39

Before Change

    basis = basis[basis < n]

    // choose additional indices to complete basis
    if len(basis) < m:
        a = np.arange(m+n)
        bl = np.zeros(len(a), dtype=bool)
        bl[basis] = 1
        new_basis = a[~bl][:m-len(basis)]
        basis = np.concatenate((basis, new_basis))

    return x, basis, A, b, residual, status, iter_k


def _generate_auxiliary_problem(A, b):

After Change

    basis = basis[basis < n]

    // if feasible, choose additional indices to complete basis
    if status == 0 and len(basis) < m:
        basis = _get_more_basis_columns(A, basis)

    return x, basis, A, b, residual, status, iter_k


def _get_more_basis_columns(A, basis):

Instances