`scipy.optimize._linprog_util:_get_Abc`

Signature

def _get_Abc ( lp , c0 )

Given a linear programming problem of the form:

Minimize

c @ x

Subject to

A_ub @ x <= b_ub
A_eq @ x == b_eq
 lb <= x <= ub

where lb = 0 and ub = None unless set in bounds.

Return the problem in standard form:

Minimize

c @ x

Subject to

A @ x == b
    x >= 0

by adding slack variables and making variable substitutions as necessary.

lp : A `scipy.optimize._linprog_util._LPProblem` consisting of the following fields:

c0 : float

Constant term in objective function due to fixed (and eliminated) variables.

A : 2-D array: 2-D array such that A @ x, gives the values of the equality constraints at x.
b : 1-D array: 1-D array of values representing the RHS of each equality constraint (row) in A (for standard form problem).
c : 1-D array: Coefficients of the linear objective function to be minimized (for standard form problem).
c0 : float: Constant term in objective function due to fixed (and eliminated) variables.
x0 : 1-D array: Starting values of the independent variables, which will be refined by the optimization algorithm