Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Total_dual_integrality> ?p ?o. }
Showing items 1 to 12 of
12
with 100 items per page.
- Total_dual_integrality abstract "In mathematical optimization, total dual integrality is a sufficient condition for the integrality of a polyhedron. Thus, the optimization of a linear objective over the integral points of such a polyhedron can be done using techniques from linear programming.A linear system , where and are rational, is called totally dual integral (TDI) if for any such that there is a feasible, bounded solution to the linear programthere is an integer optimal dual solution.Edmonds and Giles showed that if a polyhedron is the solution set of a TDI system , where has all integer entries, then every vertex of is integer-valued. Thus, if a linear program as above is solved by the simplex algorithm, the optimal solution returned will be integer. Further, Giles and Pulleyblank showed that if is a polytope whose vertices are all integer valued, then is the solution set of some TDI system , where is integer valued.Note that TDI is a weaker sufficient condition for integrality than total unimodularity.".
- Total_dual_integrality wikiPageID "37974931".
- Total_dual_integrality wikiPageRevisionID "580478325".
- Total_dual_integrality hasPhotoCollection Total_dual_integrality.
- Total_dual_integrality subject Category:Mathematical_optimization.
- Total_dual_integrality comment "In mathematical optimization, total dual integrality is a sufficient condition for the integrality of a polyhedron.".
- Total_dual_integrality label "Total dual integrality".
- Total_dual_integrality sameAs m.0pb607d.
- Total_dual_integrality sameAs Q7828108.
- Total_dual_integrality sameAs Q7828108.
- Total_dual_integrality wasDerivedFrom Total_dual_integrality?oldid=580478325.
- Total_dual_integrality isPrimaryTopicOf Total_dual_integrality.