;# a matching polytope $K4 = graph::complete(4)->ADJACENCY; print node_edge_incidences($K4); $M = matching_polytope($K4); print_constraints($M); $M->add(LP=>new LinearProgram(LINEAR_OBJECTIVE=>[0, 1,1,1,1,1,1])); print $M->LP->MAXIMAL_VALUE; print $M->LP->MAXIMAL_VERTEX;