{"entities":{"Q1075944":{"pageid":1086696,"ns":120,"title":"Item:Q1075944","lastrevid":69580545,"modified":"2026-04-13T07:59:02Z","type":"item","id":"Q1075944","labels":{"en":{"language":"en","value":"Minimax linear programming problem"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3952494"}},"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":"Q1075944$732E92DC-677E-48D6-99D2-ACF894E2F008","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"2c47170220bfcdd57fedfafa3059873d7df640dd","datavalue":{"value":{"text":"Minimax linear programming problem","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1075944$540991D4-7A3B-431F-8CC6-861B04112D5C","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"ddfe07bf68ce706d5fde9e04d9fd7d1bfa252f3c","datavalue":{"value":"0592.90062","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1075944$18433057-FFBE-4E14-84D6-180CA55C49F9","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"6da28d3bfc95e5f976e4287ebbe8d88d8abc1a4c","datavalue":{"value":"10.1016/0167-6377(85)90017-3","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1075944$B7BA0A50-6D56-4456-BD00-8BFC5FE7C3DF","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":"Q1075944$30161039-4AA3-4684-A5FA-FEF6F94BD719","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"3c94df5c9af0ede578c52141befd29044de13172","datavalue":{"value":{"time":"+1985-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":"Q1075944$132E3645-B313-4E1F-A99C-13E7D6298244","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"d0bbe338aec6be94492af50a7ed8b224c99ac99d","datavalue":{"value":"The author is concerned with the following minimax problem;  \\[  (MLPP)\\quad \\min z=\\max_{1\\leq j\\leq n}\\{c_ jx_ j\\}\\quad subject\\quad to\\quad Ax=g,\\quad x\\geq 0  \\]  where \\(c_ j\\geq 0\\) and \\(x_ j\\) are scalars, x is a column vector with components \\(x_ j\\), g is a column vector with elements \\(g_ j\\geq 0\\) and A is a \\(m\\times n\\) matrix of rank m. It is known that MLPP can be transformed into a linear programming problem by introducing n additional constraints. The author notes that the additional constraints can be considered implicitly by treating them as parametric upper bounds. Following this approach two procedures are proposed, a parametric algorithm and a primal-dual algorithm. Computational results showing the convenience of using both algorithms are given.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1075944$788ED6EB-3A7D-4C12-BF43-D2A39FB2EEBF","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"63b70ec5cb69f5c5c9550409918141ca28bfae61","datavalue":{"value":"90C08","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1075944$6DD26380-CDDA-4779-A437-F0F61C0449FE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"36d142e7ea03446b1d7deb9627eedb9f0297f86a","datavalue":{"value":"90C05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1075944$A7AEF04A-EFDA-41A9-A77A-4E50350E4558","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"fda4ba690b83a424292971e1b7f6d11354bb812b","datavalue":{"value":"3952494","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1075944$6303880A-60D8-4EDA-AB33-86A61D33D0E7","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"68046f94740bae217ab5cf59d0311cedfc0c1790","datavalue":{"value":"minimax problem","type":"string"},"datatype":"string"},"type":"statement","id":"Q1075944$446742D1-E6E1-43C3-BD52-4D411B735E27","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"3797cf7a0f71e6a9f56fbe87fe884dfedb4017aa","datavalue":{"value":"parametric upper bounds","type":"string"},"datatype":"string"},"type":"statement","id":"Q1075944$DFDF9AEB-EC75-4AB5-93B7-D30F7879B906","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"abce334c22b103ed0a170489bcb3fc96ba702667","datavalue":{"value":"parametric algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q1075944$92184C95-7891-42EA-82F9-955F23E68A60","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"d153b44b25a07c72994e52f22be04dc89bccf158","datavalue":{"value":"primal- dual algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q1075944$F41F7BFB-D905-4B30-AC94-7BE51D52AD13","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"2661a0360bf1e96bc1f5b465a8070ac88ffa8a5b","datavalue":{"value":"Computational results","type":"string"},"datatype":"string"},"type":"statement","id":"Q1075944$0EFE1332-B182-42F1-AE91-0F665CF648E8","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"6c8d6efbe53de15b37aa08c687a2038707fe736f","datavalue":{"value":{"entity-type":"item","numeric-id":229626,"id":"Q229626"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1075944$2FC58425-F6CF-4835-B96B-EABDD0C4B955","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"769969af480fdeab3e22c7e2ca3cfe6ed29778ca","datavalue":{"value":{"entity-type":"item","numeric-id":715138,"id":"Q715138"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1075944$E94FC4B1-A3E8-4F4F-B178-C851A7ABC6A9","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":"Q1075944$B89131D2-85EA-4ED7-AC25-528EA696EA73","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"d418b026c49368f9a346a8b4587f7b54821c0ef0","datavalue":{"value":"https://doi.org/10.1016/0167-6377(85)90017-3","type":"string"},"datatype":"url"},"type":"statement","id":"Q1075944$24CC6C08-5990-4F8C-8DC7-A85A5D3BF8CA","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"837829affa2bc6e02a60f199f154a18b17507129","datavalue":{"value":"W2029440362","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1075944$11C8111F-F089-4D63-8E5D-16A507501E47","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"78993ea5fe4aa76469659b43ea0a6a876e954151","datavalue":{"value":{"entity-type":"item","numeric-id":3026747,"id":"Q3026747"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1075944$7167CCD4-02C5-4FE7-8AD1-B48C8BE23C9D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"b7547b0ef0f7581990e739069f74b4e47ea54fe2","datavalue":{"value":{"entity-type":"item","numeric-id":1169406,"id":"Q1169406"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1075944$B56B0A92-77B1-49A8-98E9-F8FBEE30BBFA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"ba3c177c99019b47754b5c057ee4acf2f7c8cfd1","datavalue":{"value":{"entity-type":"item","numeric-id":4174536,"id":"Q4174536"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1075944$0B815278-88F5-44F2-8CBC-71DFDC235696","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"bcf4b3082859a3618b11336eacebb98ab4e74708","datavalue":{"value":{"entity-type":"item","numeric-id":4145173,"id":"Q4145173"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1075944$9080675C-A2F7-4BB4-84BB-1E8C7F27F5C5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"28d05307ed9bdff54278e4b6bcb3cdb3c896dcd2","datavalue":{"value":{"entity-type":"item","numeric-id":4768876,"id":"Q4768876"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1075944$C8395C56-549E-4FE9-B339-70EA0DB7B375","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"8b656f0b7f03c56709def01a253a7e888ce3f8a5","datavalue":{"value":{"entity-type":"item","numeric-id":4154015,"id":"Q4154015"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1075944$31EF7D08-0716-47DD-AA8D-0FDD7ED8F3A2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"1dbbe3ac3158330a6990b58a9a558d77085ad86b","datavalue":{"value":{"entity-type":"item","numeric-id":4039868,"id":"Q4039868"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1075944$D5E91C8B-A713-4C15-8DDD-53789ABDA680","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"ac9e1d459d12f1dcd69e62da8a1ab5b61fb5736f","datavalue":{"value":{"entity-type":"item","numeric-id":5685853,"id":"Q5685853"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1075944$5BF74CB8-2C51-4F3E-9BE5-292688C64561","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"713f9dd5cc56f2ca6d73631dbb30c07931be123a","datavalue":{"value":{"entity-type":"item","numeric-id":3905079,"id":"Q3905079"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1075944$597BE9EA-6A17-4EAF-89CA-B65888036823","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"bbfbb10ddbeb7f027f6cd64171d03e538b60b03e","datavalue":{"value":{"entity-type":"item","numeric-id":4729610,"id":"Q4729610"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"d6afcbc6f62c5ca90a5da2c244f48cd5e09233a5","datavalue":{"value":{"amount":"+0.7849140167236328","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":"Q1075944$50D1651B-FAC7-4B8B-99B8-B1AA7D0C7F7E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"5bc7adb2a268dee5b4ce9adef4dc621acc210397","datavalue":{"value":{"entity-type":"item","numeric-id":1180710,"id":"Q1180710"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"2b9bed16a93d0450f0366de8893105a5a4b4fcf5","datavalue":{"value":{"amount":"+0.7765344977378845","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":"Q1075944$C8C7021E-A999-4B6A-AF29-29E9F3D1FD20","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"8deb7773ff90c7f96125fb49eaf88166c35fb494","datavalue":{"value":{"entity-type":"item","numeric-id":3347661,"id":"Q3347661"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"cdc04bdc0a688bdd8e3caca7ff6b3252d81a64d5","datavalue":{"value":{"amount":"+0.7756755948066711","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":"Q1075944$BD3E7904-4253-4592-8B60-5ACD0D7B422E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"88ccfe496ac36295d1b201087931d5ef583b6b64","datavalue":{"value":{"entity-type":"item","numeric-id":750317,"id":"Q750317"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"3f3ef0b1a7b4e97c5ab1a262d62233bc9f3ae5b0","datavalue":{"value":{"amount":"+0.7662912607192993","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":"Q1075944$7DFD446F-42AE-4E39-B555-6FF757628B58","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"6d39f90d1debcfd79c87231bcfa562e2e5c495ff","datavalue":{"value":{"entity-type":"item","numeric-id":1092812,"id":"Q1092812"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"838cdbd3f8f02be9a338c6b470b43783508a1563","datavalue":{"value":{"amount":"+0.7598073482513428","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":"Q1075944$AB0E588A-E8D3-4823-8858-3FAA9BA87129","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Minimax linear programming problem","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Minimax_linear_programming_problem"}}}}}