{"entities":{"Q1237650":{"pageid":1248400,"ns":120,"title":"Item:Q1237650","lastrevid":80717384,"modified":"2026-05-06T16:50:29Z","type":"item","id":"Q1237650","labels":{"en":{"language":"en","value":"Convex simplex method and non-linear programming problems"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3555750"}},"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":"Q1237650$E5757A87-124F-4A10-8A01-6FB533F3D530","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"585018815f55a2de7b12978bb093c3d18ba77a73","datavalue":{"value":{"text":"Convex simplex method and non-linear programming problems","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1237650$D0BBFA8D-287B-476B-B8DB-907E069C1A66","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"c05f64eccfc6bb8b365f0713c63a389f892f74cd","datavalue":{"value":"0356.90054","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1237650$10A4E5F0-3AF0-44DC-B02B-CE37BD7EA7DE","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"5a54167154cd5c9f71f265cfafb50393f9a505bf","datavalue":{"value":{"entity-type":"item","numeric-id":598996,"id":"Q598996"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1237650$1E506B3D-1D0E-4799-AB6E-DDAB4F2AD179","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"21d6d9f0c2411188f4a3362e96dcbb4bcac0a3d1","datavalue":{"value":{"entity-type":"item","numeric-id":1237649,"id":"Q1237649"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1237650$C181E624-21A4-484B-BECF-2A367BB31D5A","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"0880aa7dda3bbf22b991349876cdfc0e33b32d5f","datavalue":{"value":{"entity-type":"item","numeric-id":164177,"id":"Q164177"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1237650$32C7CCE6-0BFF-4944-9351-1ED308CFE8F5","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"b5e8f5a4bedcdf1368f667e537d4925490c864ae","datavalue":{"value":{"time":"+1975-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":"Q1237650$EF5B9C6A-6098-4F59-921E-57FA8FFA8B73","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ccd1dd4cefa81e8158b9f080486a4eaed61a9ee8","datavalue":{"value":"90C25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1237650$05CF6CE3-9E5F-4C8F-B9F3-EF665F676FEA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"52de7d4bf5a27d5ad252804eec58396bb3e40c44","datavalue":{"value":"90C30","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1237650$64F1A1FA-6A93-4E42-94F6-FB8C5403553B","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"fb74389f1444db0142e13305eac62f0fdbdb1809","datavalue":{"value":"3555750","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1237650$8713456B-CC13-4728-966A-976E5CEBD791","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":"Q1237650$7393E225-DFD8-4775-BC35-BCE92F722890","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Convex simplex method and non-linear programming problems","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Convex_simplex_method_and_non-linear_programming_problems"}}}}}