{"entities":{"Q7361081":{"pageid":31518782,"ns":120,"title":"Item:Q7361081","lastrevid":105362606,"modified":"2026-10-07T13:34:22Z","type":"item","id":"Q7361081","labels":{"en":{"language":"en","value":"Duality of Linear Programming"}},"descriptions":{"en":{"language":"en","value":"AFP entry LP_Duality"}},"aliases":{},"claims":{"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"9b1657949c909d80d383be9b0322eb58523694fa","datavalue":{"value":"https://isa-afp.org/entries/LP_Duality.html","type":"string"},"datatype":"url"},"type":"statement","id":"Q7361081$F39C31E4-5D49-42D6-842F-F3C2947FE11F","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"f5a5604a0f4fdf263aeff6e3f6a290b0ccd8766f","datavalue":{"value":{"time":"+2022-02-03T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q7361081$4481BFCF-C6DB-4735-9256-46862BA35026","rank":"normal"}],"P43":[{"mainsnak":{"snaktype":"value","property":"P43","hash":"3e961f1f2b2e533bd88ffdbcd178bd2ef2813f73","datavalue":{"value":"Ren\u00e9 Thiemann","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361081$EE01421F-3AF1-4283-B25E-F6D0087775F0","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"85c739a70d4330261025248d1fa03f7f96845964","datavalue":{"value":{"text":"Duality of Linear Programming","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q7361081$80B2D50D-69CA-4CB6-828B-74E5477E701F","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"8df59afffe2463e353b1a4da3f3129696f91f172","datavalue":{"value":"We formalize the weak and strong duality theorems of linear programming. For the strong duality theorem we provide three sufficient preconditions: both the primal problem and the dual problem are satisfiable, the primal problem is satisfiable and bounded, or the dual problem is satisfiable and bounded. The proofs are based on an existing formalization of Farkas' Lemma.","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361081$FF8916E2-7CF0-4D2D-A4CA-842CDA95FEDD","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"14d65f813b7bf62e89eaf2eb886e2ecf258499df","datavalue":{"value":{"entity-type":"item","numeric-id":4221106,"id":"Q4221106"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361081$6DB951FE-6F6A-4D82-A620-845E6D589706","rank":"normal"}],"P37":[{"mainsnak":{"snaktype":"value","property":"P37","hash":"9a21a8eebe97539644aa32b24dda137c12e751dc","datavalue":{"value":{"entity-type":"item","numeric-id":40327,"id":"Q40327"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361081$700730C5-4750-42FD-AFBF-5D84FAB208D6","rank":"normal"}],"P585":[{"mainsnak":{"snaktype":"value","property":"P585","hash":"e934873d8bac5a077691303d5dcd88e1647e83c9","datavalue":{"value":{"entity-type":"item","numeric-id":7361012,"id":"Q7361012"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361081$9B563943-188D-470E-A568-408206102C4A","rank":"normal"}],"P2651":[{"mainsnak":{"snaktype":"value","property":"P2651","hash":"65292b3c42fa1bd5c21e4c91fe94fdc3f630f232","datavalue":{"value":{"entity-type":"item","numeric-id":7360821,"id":"Q7360821"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361081$54E2893D-77EF-41F6-B1C2-F25E3BC8EDBC","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"908c3454b3659c4b140ccce33c5aee31081edc8d","datavalue":{"value":{"entity-type":"item","numeric-id":5976450,"id":"Q5976450"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361081$43A30BD6-1B04-43CD-8D48-EEAB214E03A1","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Duality of Linear Programming","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Duality_of_Linear_Programming"}}}}}