This template is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics
__DTSUBSCRIBEBUTTONDESKTOP__{"headingLevel":2,"name":"h-Mastergreg82-2022-03-20T12:54:00.000Z","type":"heading","level":0,"id":"h-Are_\"pairs\"_here_duals?-2022-03-20T12:54:00.000Z","replies":["c-Mastergreg82-2022-03-20T12:54:00.000Z-Are_\"pairs\"_here_duals?"],"text":"Are \"pairs\" here duals?","linkableTitle":"Are \"pairs\" here duals?"}-->
__DTSUBSCRIBEBUTTONMOBILE__{"headingLevel":2,"name":"h-Mastergreg82-2022-03-20T12:54:00.000Z","type":"heading","level":0,"id":"h-Are_\"pairs\"_here_duals?-2022-03-20T12:54:00.000Z","replies":["c-Mastergreg82-2022-03-20T12:54:00.000Z-Are_\"pairs\"_here_duals?"],"text":"Are \"pairs\" here duals?","linkableTitle":"Are \"pairs\" here duals?"}-->
This template exhibits some "pairs" of problems. Clicking on the title drives to the notion of dual linear programs.
Although some of the problems in this table are effectively duals (bin packing and bin covering for instance), others are NOT! For example, Minimum Vertex Cover is not the dual of Maximum Independent Set ; its dual is Maximum Matching. It introduces a lot of confusion...
Mastergreg82 (talk) 12:54, 20 March 2022 (UTC)[reply]__DTELLIPSISBUTTON__{"threadItem":{"timestamp":"2022-03-20T12:54:00.000Z","author":"Mastergreg82","type":"comment","level":1,"id":"c-Mastergreg82-2022-03-20T12:54:00.000Z-Are_\"pairs\"_here_duals?","replies":[]}}-->