_parse_linprog(lp, options, meth)
_parse_linprog
employs two main steps _check_sparse_inputs
and _clean_inputs
. _check_sparse_inputs
checks for sparsity in the provided constraints ( A_ub
and ``A_eq) and if these match the provided sparsity optional values.
_clean inputs
checks of the provided inputs. If no violations are identified the objective vector, upper bound constraints, equality constraints, and simple bounds are returned in the expected format.
c
c
A_ub
A_ub
b_ub
b_ub
A_eq
A_eq
b_eq
b_eq
bounds
bounds
x0
x0
A dictionary of solver options. All methods accept the following generic options:
maxiter
maxiter
disp
disp
For method-specific options, see show_options('linprog')
.
c
c
A_ub
A_ub
b_ub
b_ub
A_eq
A_eq
b_eq
b_eq
bounds
bounds
x0
x0
A dictionary of solver options. All methods accept the following generic options:
maxiter
maxiter
disp
disp
For method-specific options, see show_options('linprog')
.
Parse the provided linear programming problem
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