_postsolve(x, postsolve_args, complete=False)
Solution vector to the standard-form problem.
Data needed by _postsolve to convert the solution to the standard-form problem into the solution to the original problem, including:
c
c
A_ub
A_ub
b_ub
b_ub
A_eq
A_eq
b_eq
b_eq
bounds
bounds
x0
x0
the functions in the list reverse the operations of _presolve() the function signature is x_org = f(x_mod), where x_mod is the result of a presolve step and x_org the value at the start of the step
Whether the solution is was determined in presolve ( True
if so)
Solution vector to original linear programming problem
optimal objective value for original problem
The (non-negative) slack in the upper bound constraints, that is, b_ub - A_ub @ x
The (nominally zero) residuals of the equality constraints, that is, b - A_eq @ x
Given solution x to presolved, standard form linear program x, add fixed variables back into the problem and undo the variable substitutions to get solution to original linear program. Also, calculate the objective function value, slack in original upper bound constraints, and residuals in original equality constraints.
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