_get_Abc(lp, c0)
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.
c
c
A_ub
A_ub
b_ub
b_ub
A_eq
A_eq
b_eq
b_eq
bounds
bounds
x0
x0
Constant term in objective function due to fixed (and eliminated) variables.
2-D array such that A
@ x
, gives the values of the equality constraints at x
.
1-D array of values representing the RHS of each equality constraint (row) in A (for standard form problem).
Coefficients of the linear objective function to be minimized (for standard form problem).
Constant term in objective function due to fixed (and eliminated) variables.
Starting values of the independent variables, which will be refined by the optimization algorithm
Given a linear programming problem of the form:
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them