{"entities":{"Q1078069":{"pageid":1088821,"ns":120,"title":"Item:Q1078069","lastrevid":66827847,"modified":"2026-04-12T13:08:00Z","type":"item","id":"Q1078069","labels":{"en":{"language":"en","value":"An algorithm for solving a structured class of linear programming problems"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3959122"}},"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":"Q1078069$C810DB44-7996-4BFE-B27B-773AA76E63C5","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"acde327c24f28098d183c2d41d88389b228f8de5","datavalue":{"value":{"text":"An algorithm for solving a structured class of linear programming problems","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1078069$CEAD5DDB-06B5-48D4-A2E1-9B6C008AE633","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"59c6422ad856ca0ae3c5ae1470742d5eb666e37f","datavalue":{"value":"0595.90055","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1078069$723FECF3-3DC1-446D-9AD3-DF56D8FDD74C","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"7acba5d48f2c673aae5f3ee44f592a359695918a","datavalue":{"value":"10.1016/0167-6377(86)90032-5","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1078069$A8ED0659-F08C-404D-A277-E3753510FEB5","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"3da3ce3cd19740c4de28d733246d4d88537c788f","datavalue":{"value":{"entity-type":"item","numeric-id":583076,"id":"Q583076"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1078069$7D18CBC9-7664-4425-8345-C6DF2712A5A0","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"f9747a37b0b56aeca2085282046e2737cd5087ca","datavalue":{"value":{"entity-type":"item","numeric-id":96289,"id":"Q96289"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1078069$BA6971BF-E576-413A-AC2A-DADD30A30BE5","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"63df7153432d81fa42019fcabb076c89649b0b5b","datavalue":{"value":{"time":"+1986-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":"Q1078069$ACE98E3C-D148-44A8-BFB0-9F6A23E9F01D","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"844562bf109f5670e826696af9a9f1d4115d6b2a","datavalue":{"value":"The author presents a procedure for solving the following class of specially structured linear programs: maximize \\(Z_{PN}=\\sum_{j\\in J}c_ jx_ j\\) subject to \\(\\ell_ i\\leq \\sum_{i\\in J(i)}a_ jx_ j\\leq b_ i,\\) \\(i=1,2,...,m,\\) \\(d_ j\\leq x_ j\\leq u_ j,\\) \\(j\\in J,\\) where \\(b_ i,\\) \\(c_ j\\) and \\(a_ j\\) are positive and \\(d_ j\\) are nonnegative scalars, \\(J=\\cup^{m}_{i=1}J(i)\\) and the sets J(i) are assumed to be nested: if \\(i\\neq k\\) then either J(i) and J(k) are disjoint or one set is properly contained in the other. The proposed algorithm consists of solving a sequence of continuous knapsack problems each of which requires linear time to solve. The computational effort required by the procedure is proportional to the number of non-zero entries in the constant matrix.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1078069$8B4647D9-B9A8-4842-BA7C-28EE9519F06C","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"36d142e7ea03446b1d7deb9627eedb9f0297f86a","datavalue":{"value":"90C05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1078069$ED42AD35-76F2-4E86-BB84-0E12DD80B9B5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"418d4d19aa7c87e33d52e580c9c108a1bc2de096","datavalue":{"value":"90C90","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1078069$E51B738A-A44A-4B62-8587-A9DF38137D53","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"0b4fa5b59eb6fe6e43618f9e005f4a49f4390971","datavalue":{"value":"65K05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1078069$42CBBE16-DD39-42BC-B9C2-3381BD944BF4","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"0b969398048ade79ca4db71c2551d6a667a14f25","datavalue":{"value":"3959122","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1078069$2622DF23-37A1-4F50-A906-F293500B5FC0","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"45889b9abcca90af1d70465703d3c1136fabaeae","datavalue":{"value":"portfolio selection","type":"string"},"datatype":"string"},"type":"statement","id":"Q1078069$D4A0688A-22E9-4EB7-9E9E-007D2FEAA59B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0382a6bc12e32dc45f1bf49f83ffdeba5b3e04dc","datavalue":{"value":"advertising","type":"string"},"datatype":"string"},"type":"statement","id":"Q1078069$7488ADA7-36D6-4BBE-9156-205AA5142074","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"2271d81b8af2dbc22e270efd1c30bd05164bfd64","datavalue":{"value":"production planning","type":"string"},"datatype":"string"},"type":"statement","id":"Q1078069$B42058C6-CF15-4963-83C9-03156A1AB0CE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e81fc0b274ca6568194209cb25b533d8b15c5470","datavalue":{"value":"interval","type":"string"},"datatype":"string"},"type":"statement","id":"Q1078069$81438339-1CEB-4B43-98B9-A4EF84D81CF2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"a08efa1a08a750d06fca0196004a17a02a35c592","datavalue":{"value":"linear programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q1078069$82555A01-023B-4EF8-B446-5B3FEC7309A1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"9de86e88c243a470928d14497b891d099a822018","datavalue":{"value":"knapsack","type":"string"},"datatype":"string"},"type":"statement","id":"Q1078069$4877EABF-3AAC-41A1-829C-48BBE4740846","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"87c53711592058f093f553bc3f524a2df658ded2","datavalue":{"value":"weighted selection algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q1078069$9FFF035A-2714-48C1-8B68-AAB417EB4590","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"4d1b2ac930b99050cf12d9ff1ab95177c790ad36","datavalue":{"value":"specially structured linear programs","type":"string"},"datatype":"string"},"type":"statement","id":"Q1078069$D212AECF-F06A-4FA3-B3F3-CE3CE8B5C9B0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"a25207ba523ab9ceb3e613351ed9d54dd7cc3a81","datavalue":{"value":"sequence of continuous knapsack problems","type":"string"},"datatype":"string"},"type":"statement","id":"Q1078069$6E9E8DAE-C881-477A-82E9-1056D8BC5720","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":"Q1078069$3D226DC2-6094-4D43-8A4B-484F0819880F","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"8d2bb431661a3b44ac7b8d21160be9285aa31a8e","datavalue":{"value":"https://doi.org/10.1016/0167-6377(86)90032-5","type":"string"},"datatype":"url"},"type":"statement","id":"Q1078069$A7549C08-D111-4B8A-94FD-D2A45CB2F706","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"aecfdb88f374cb6a1b43b1e9fc01e277ac1541fa","datavalue":{"value":"W2090512332","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1078069$0CA1805D-0854-43E9-AB2A-5B1AAEAA09C9","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"7e3c092fff175044584821adddc628ab2c7d1dac","datavalue":{"value":{"entity-type":"item","numeric-id":2641219,"id":"Q2641219"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1078069$7C4A6614-E2F7-4ABA-B214-7D69D4D0C965","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"f8320230293fbb48c659950e66d50f67b46043ee","datavalue":{"value":{"entity-type":"item","numeric-id":3325442,"id":"Q3325442"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1078069$D260DA14-CADB-4363-BF67-A8619825D16C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"d5ad2513b4261a06196ae6bb59606813b7f3b625","datavalue":{"value":{"entity-type":"item","numeric-id":5638140,"id":"Q5638140"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1078069$8D6D4990-E894-453D-ABFF-412FF22F8F68","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"89d5fda4b231c26835cf76402ea0dec5165087b4","datavalue":{"value":{"entity-type":"item","numeric-id":5585863,"id":"Q5585863"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1078069$FDDFC5BC-FF7C-46FD-A5D5-210A05B95090","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"101acb63836e76dd367e406f6889bf82e5164435","datavalue":{"value":{"entity-type":"item","numeric-id":3475124,"id":"Q3475124"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"89365b24f03fc2d9c40d6858fccae91ccf0d1050","datavalue":{"value":{"amount":"+0.7950076460838318","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":"Q1078069$3A2ED975-C33F-44F1-A658-F596209D63CE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"2f3410254f46cd28b010d551faa9b2e7f4cfae14","datavalue":{"value":{"entity-type":"item","numeric-id":761347,"id":"Q761347"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"3e12c75cef584233c32ad98d06c0f7a83038a8a5","datavalue":{"value":{"amount":"+0.7920657396316528","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":"Q1078069$5587AA1C-7C4D-476E-8BDE-8B9CD659EB43","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"3e795f571d2a900771039e316b7ba3e28c5d1f0d","datavalue":{"value":{"entity-type":"item","numeric-id":756930,"id":"Q756930"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"095005c9d773c3f0b975a33042e3a13a48b6fa1d","datavalue":{"value":{"amount":"+0.7891132235527039","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":"Q1078069$DF29E3A0-93E2-45F8-962C-A2592D2BC0F3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"8f59bd881ff511a0d554d05ae3e424f22ebd372b","datavalue":{"value":{"entity-type":"item","numeric-id":1074311,"id":"Q1074311"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"e4a7cb9671a43912f9fe345535c307d51efb4eb1","datavalue":{"value":{"amount":"+0.7880977392196655","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":"Q1078069$ED90A187-EB99-4084-B7BC-63136461DBC6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"65f25558cecbec6cab564ea81aeed2d1683e426c","datavalue":{"value":{"entity-type":"item","numeric-id":2277359,"id":"Q2277359"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"a05ec91aad87f3eee07c4a3f853931e6dc0f8028","datavalue":{"value":{"amount":"+0.7795592546463013","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":"Q1078069$E07B8B43-F838-4C25-9D4C-980CD2927113","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An algorithm for solving a structured class of linear programming problems","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_algorithm_for_solving_a_structured_class_of_linear_programming_problems"}}}}}