{"entities":{"Q1207191":{"pageid":1217940,"ns":120,"title":"Item:Q1207191","lastrevid":66307518,"modified":"2026-04-12T09:05:07Z","type":"item","id":"Q1207191","labels":{"en":{"language":"en","value":"New algorithms for linear programming"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 149349"}},"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":"Q1207191$29BD5CA9-D8FE-4894-AFED-7D798E35FDC7","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"f2efd7a9ca22698e392877539a2ffb2b28601cf7","datavalue":{"value":{"text":"New algorithms for linear programming","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1207191$1B158ED1-DB15-478F-A401-94F632166F3C","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"ecb299b62cda17d54cbc5572b5ac0124a15b490d","datavalue":{"value":"0762.90054","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1207191$29B66254-5976-4205-BD69-C72DEAB7B476","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"4bf5480cc812ddde826ae35f5c2b87248aab5680","datavalue":{"value":"10.1007/BF02006070","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1207191$9C054F79-82B2-4D1C-B9E1-3B6E19F277A0","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"321977fae0774d9e035ff59c71823e9d268b49b6","datavalue":{"value":{"entity-type":"item","numeric-id":1198610,"id":"Q1198610"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1207191$A27FEA79-7EAF-47F3-915C-99EDB71FE79F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"9d454478a560b024bf27a26353b4ae33be479c0a","datavalue":{"value":{"entity-type":"item","numeric-id":176694,"id":"Q176694"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1207191$B46D016D-8C2F-471D-AFA5-D78FF87424A7","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"bd8a7678534b4c4a434a737b8e34eefad997d7a4","datavalue":{"value":{"entity-type":"item","numeric-id":176689,"id":"Q176689"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1207191$675183C2-B412-4B92-BB49-1F5FE6ED664D","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"8604b2a4c08e4f5e10819826d060da1f7baa01ac","datavalue":{"value":{"time":"+1993-04-01T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1207191$4BC09F75-BBC2-4246-9CF4-666D5AC98417","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"9cb02cd212f8778efb3c14048c6178e182669ca9","datavalue":{"value":"The linear programming problem of the form \\(\\min c^ T x\\), subject to \\(Ax=b\\), \\(0\\leq x\\leq d\\), is converted into a nonlinear unconstrained maximization problem with a concave objective function. Two algorithms are proposed for solving this unconstrained maximization problem. The first one uses the gradient method, the second one the variable metric method. Both algorithms terminate in a finite number of steps for any given accuracy.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1207191$10F141B9-625C-4DDA-A477-44FA23BAEB4D","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"36d142e7ea03446b1d7deb9627eedb9f0297f86a","datavalue":{"value":"90C05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1207191$2F0D24F1-018F-4B6B-9F1F-CCCFA853E369","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ccd1dd4cefa81e8158b9f080486a4eaed61a9ee8","datavalue":{"value":"90C25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1207191$78C88A12-E9FC-4397-9A1C-D39F524DB0C1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"52de7d4bf5a27d5ad252804eec58396bb3e40c44","datavalue":{"value":"90C30","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1207191$93A37406-7C15-4E72-AFE2-43B8413F9159","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"6c738182550992ce779c408a5c0b5a5b532a283f","datavalue":{"value":"149349","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1207191$14DA90AA-1783-4378-8063-CA345D2DC48E","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"9360e93273af8817801885356f825976954816c7","datavalue":{"value":"nonlinear unconstrained maximization","type":"string"},"datatype":"string"},"type":"statement","id":"Q1207191$C2D8F205-ADF7-410D-A45B-3F9835EF9D67","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f0bdb463509a5b285a72075c0ec5a4a84a441323","datavalue":{"value":"concave objective function","type":"string"},"datatype":"string"},"type":"statement","id":"Q1207191$4C95E7A4-AD1F-4647-9B8E-3323D246443C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f68be6ceff2e16711039a844329d9853d0ba9ce4","datavalue":{"value":"gradient method","type":"string"},"datatype":"string"},"type":"statement","id":"Q1207191$630C64CD-4197-46FD-96B7-07BF11F3F483","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e22e9d2e7c457db98ba1ea26ad38479e416740ec","datavalue":{"value":"variable metric method","type":"string"},"datatype":"string"},"type":"statement","id":"Q1207191$E9CA0106-5EAF-44AF-B66E-8F89AB089FE5","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"ede5e36d99765c94dd5c6a42dd41c767ba4453ac","datavalue":{"value":{"entity-type":"item","numeric-id":300797,"id":"Q300797"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1207191$45ADA4A1-4D1F-4EB2-B2FF-7ECC53E59845","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":"Q1207191$AE840DAE-BE15-4340-B81B-D661FAD95490","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"31d6ebdf3a7e294afcad7d94513a26db74781758","datavalue":{"value":{"entity-type":"item","numeric-id":3913381,"id":"Q3913381"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1207191$49EF5B80-859D-4EC4-9EF5-19BC2B11364E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"37f39a8eecb709a66232d92a69036bfaddc4d8c9","datavalue":{"value":{"entity-type":"item","numeric-id":4107408,"id":"Q4107408"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1207191$17BA9775-CD92-46E4-9C33-2AA2C8213699","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"fbc87127d222d68a031e424093361cbfa13cf13e","datavalue":{"value":"https://doi.org/10.1007/bf02006070","type":"string"},"datatype":"url"},"type":"statement","id":"Q1207191$C92131A7-AF6C-4403-AE93-26C271076991","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"e4b9eb65955a0ee585bb5b51842941ed4e5ed34e","datavalue":{"value":"W2016937181","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1207191$81FE40F1-2742-4AF3-BAAA-1D60D34FD805","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"b67fbdf7f6991631b9020b574edfd1efb7ee318d","datavalue":{"value":{"entity-type":"item","numeric-id":761967,"id":"Q761967"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"d9c468418899d4cf6e9e1ea8c3a496a9873c00ea","datavalue":{"value":{"amount":"+0.844079315662384","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1207191$4BE8B7C2-4FC5-4D74-8B85-F89A6570B6F6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"fad187409d509c089aac6f338e1f104d2d07c5ca","datavalue":{"value":{"entity-type":"item","numeric-id":4206563,"id":"Q4206563"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"0ded62c36b3baf12cd663a2ef0a60fcabdffc2dd","datavalue":{"value":{"amount":"+0.8351128101348877","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1207191$8533DABB-448E-4509-93C5-59CD7FB197EE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"8b4b7d9d46a71e7b09691a0bcec30c9a207dbd0a","datavalue":{"value":{"entity-type":"item","numeric-id":3767122,"id":"Q3767122"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"6391cebac479f49cf65f994bc86de94778530732","datavalue":{"value":{"amount":"+0.8312020301818848","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1207191$76AF7190-29E8-4616-AB49-8E00D290021F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"de23f811e8d84882a5bce171c67a41bfd0ae23a1","datavalue":{"value":{"entity-type":"item","numeric-id":3028715,"id":"Q3028715"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"79904e2fa2dcf37800c52550c9309f2138365b1c","datavalue":{"value":{"amount":"+0.8292385339736938","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1207191$6D5FAE5F-762C-40A4-BCA2-7A860806862E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"d3b405540f2415d6803fa2cd91197c1cdb2c1560","datavalue":{"value":{"entity-type":"item","numeric-id":2371599,"id":"Q2371599"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"29dffba8417fa1702b5ae9581d69f15b0604ef1b","datavalue":{"value":{"amount":"+0.8270241022109985","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1207191$6CC68F3F-C19B-4542-B133-3F30F064009B","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"New algorithms for linear programming","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/New_algorithms_for_linear_programming"}}}}}