iginal linear programming problem
fun: float
    optimal objective value for original problem
slack : 1-D array
    The (non-negative) slack in the upper bound constraints, that is,
    ``b_ub - A_ub @ x``
con : 1-D array
    The (nominally zero) residuals of the equality constraints, that is,
    ``b - A_eq @ x``
r