{"entities":{"Q1135196":{"pageid":1145945,"ns":120,"title":"Item:Q1135196","lastrevid":66893844,"modified":"2026-04-12T13:34:34Z","type":"item","id":"Q1135196","labels":{"en":{"language":"en","value":"Direct and dual minimal feasible methods for solving a general linear programming problem"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3661094"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1135196$423890EE-4E49-4F6B-9B52-E70AAABF715D","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"b70cece11fffa68da7ad6aa88b1225d6ddfd1512","datavalue":{"value":{"text":"Direct and dual minimal feasible methods for solving a general linear programming problem","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1135196$8D9FF6EC-DE53-409E-8459-CA6B0D778F4C","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"3641de1715de0609fbf80937ea056eb7cb13efcc","datavalue":{"value":"0424.90044","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1135196$F2C85C0B-4AB8-4718-91F1-2CDF0FB007F1","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"33359fd8a77e9cce0cfaf7c91dc047e11a0fed75","datavalue":{"value":{"entity-type":"item","numeric-id":109332,"id":"Q109332"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1135196$FCBBD663-D356-4EB3-803A-0414BACCC6B4","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"a49472451190faf858f564fafd4bcba399999753","datavalue":{"value":{"time":"+1977-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1135196$5CAD4E74-4F8F-4C16-8109-B1B2519F339A","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"36d142e7ea03446b1d7deb9627eedb9f0297f86a","datavalue":{"value":"90C05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1135196$9A830FAF-1A1A-4E53-BF99-F13E40053CF3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"0b4fa5b59eb6fe6e43618f9e005f4a49f4390971","datavalue":{"value":"65K05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1135196$E9ECD608-D904-43EC-8147-7B814DFDC84D","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"c2fadadffdeac0bdfd1f0a38ce22011e2e2556ce","datavalue":{"value":"3661094","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1135196$BB9C3DD6-71E9-4B64-BDD2-8919DC334230","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"9560f36f43065085e3afa91c117a3749aa103edf","datavalue":{"value":"general linear programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q1135196$7F88B792-662D-496E-A2B0-63DF22A084D9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1b3c5cd6889aa9af810491f1b7e99b68896866ab","datavalue":{"value":"minimal feasible solution","type":"string"},"datatype":"string"},"type":"statement","id":"Q1135196$743D5F7A-FD78-467F-9F57-473AB6BB5141","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"bda4b4cf545e0f5465585738d9292c46ef64afc5","datavalue":{"value":"direct and dual problems","type":"string"},"datatype":"string"},"type":"statement","id":"Q1135196$E817DF39-5279-4952-913E-3B9091C2CC65","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"d607627523840bd0bf4407097f29a3a99ef4a0a8","datavalue":{"value":"algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q1135196$BC32430A-DD0D-4471-A06A-CED97FD55289","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"902c4c58bd1870de70f1ef521488a239405eb772","datavalue":{"value":"suboptimal solutions","type":"string"},"datatype":"string"},"type":"statement","id":"Q1135196$8F673BEB-D436-421B-AC2B-912828E102E3","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"b16923947045959b0232c4f48087e5510777ba07","datavalue":{"value":{"entity-type":"item","numeric-id":447678,"id":"Q447678"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1135196$599EA394-A680-4609-97C0-37F40854269A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"6ccdc262eaef894f6be05210ca881192451d2e91","datavalue":{"value":{"entity-type":"item","numeric-id":447680,"id":"Q447680"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1135196$708FD7A6-50FD-4D2B-A7AA-A396E5172730","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1135196$BFF368F3-4D44-41B4-8C80-1ED78524FC4E","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Direct and dual minimal feasible methods for solving a general linear programming problem","badges":[]}}}}}