_clean_inputs(lp)
c
c
A_ub
A_ub
b_ub
b_ub
A_eq
A_eq
b_eq
b_eq
bounds
bounds
x0
x0
c
c
A_ub
A_ub
b_ub
b_ub
A_eq
A_eq
b_eq
b_eq
bounds
bounds
x0
x0
Given user inputs for a linear programming problem, return the objective vector, upper bound constraints, equality constraints, and simple bounds in a preferred format.
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