_format_A_constraints(A, n_x, sparse_lhs=False)
2-D array such that A @ x
gives the values of the upper-bound (in)equality constraints at x
.
The number of variables in the linear programming problem.
Whether either of :None:None:`A_ub` or :None:None:`A_eq` are sparse. If true return a coo_matrix instead of a numpy array.
2-D array such that A @ x
gives the values of the upper-bound (in)equality constraints at x
.
Format the left hand side of the constraints to a 2-D array
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