{"entities":{"Q2367804":{"pageid":2378547,"ns":120,"title":"Item:Q2367804","lastrevid":72615435,"modified":"2026-04-14T06:06:17Z","type":"item","id":"Q2367804","labels":{"en":{"language":"en","value":"An inequality sorting algorithm for a class of linear programming problems"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 269909"}},"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":"Q2367804$850CC5F7-A24E-4715-9B29-285D5BE8BAF2","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"c1032d3114e7009a1c6b2ff0e1ad481591dbd3a5","datavalue":{"value":{"text":"An inequality sorting algorithm for a class of linear programming problems","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2367804$B9858C11-9AB1-405C-86E6-85A5116102D7","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"b19970a719d20fdba9e9114e25bc404e777c28f0","datavalue":{"value":"0778.90036","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2367804$90BD92A7-66D8-446C-A497-2E8CB53F2A99","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"c5ad7b9baf8e531c6b1ad954eb5f2899cc8fe5e5","datavalue":{"value":{"entity-type":"item","numeric-id":85344,"id":"Q85344"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2367804$66B77D5D-C6A4-425B-BFA0-0B8585DF176D","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"e67891bd4a89d660075c438dd64e2a1a41a79c18","datavalue":{"value":{"time":"+1993-08-15T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2367804$4ECD645B-D36D-4FAC-B225-EA6BBE58D8A9","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"03ea24763770e4a2ef5a8a4ab06b314c4e6c90d9","datavalue":{"value":"A new algorithm is proposed and investigated for the interval programming problem   (1): \\(\\max\\{b'x:c\\leq Ax\\leq d\\}\\). The authors assume that the problem is feasible and has a bounded optimal solution \\(x=A^ + e+Pz\\), \\(A\\) is an \\((m\\times n)\\)-matrix, the rank of \\(A\\) is \\(r\\), \\(r=m\\). Here \\(P\\) is a projection operator, and \\(A^ +\\) is the Moore-Penrose inverse. The proposed algorithm normalizes the inequalities of (1), arranges the normalized inequalities in ascending order of the right-most transformed elements \\(d_ i\\), seeves out the first \\(r\\) linear independent inequalities, computes the solution of (1) with these \\(r\\) inequalities , and then checks which inequalities are not satisfied on the left-most inequality. The algorithm eliminates the unsatisfied inequalities, arranges the remaining inequalities in ascending order, and once again computes the solution of (1).","type":"string"},"datatype":"string"},"type":"statement","id":"Q2367804$29212761-4D92-4368-974A-207BB2EC2EC2","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"36d142e7ea03446b1d7deb9627eedb9f0297f86a","datavalue":{"value":"90C05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2367804$37282B2C-DED8-4FB3-AC1F-ECCDD2583386","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"d550400b67148ac150a943881fbd05e682ea56f5","datavalue":{"value":"90-08","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2367804$BE2E9D62-F8D2-42CF-A8A1-00B278CE0F56","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"21b452b457b109dbf57a451bc14082e8db233a6a","datavalue":{"value":"269909","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2367804$2BAFCAED-4532-42C4-9D08-ACF97014C39A","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"3ae006d8a7f565056f1f2082c4eb4b93eba5d27f","datavalue":{"value":"interval programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q2367804$041A7587-97CC-44A3-94ED-EBBE3BBD6484","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"66670b763d9cff4fdf62fbff43fe6fbd53977acd","datavalue":{"value":{"entity-type":"item","numeric-id":1774497,"id":"Q1774497"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2367804$E6CCCE8D-5F8F-44C6-B186-9334E6FE8FC8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"a08bb58afbf9421bb0b6e42aefa2c357d01731ce","datavalue":{"value":{"entity-type":"item","numeric-id":544934,"id":"Q544934"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2367804$397007D4-F5C5-4F81-A9C6-984D0CD192F6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"b5ce8cb080cdd881ae4debcd487563d5f837e272","datavalue":{"value":{"entity-type":"item","numeric-id":426007,"id":"Q426007"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2367804$92A1E8DB-4E07-4134-A4A5-37B00029A8FA","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"84cd5d0ceb5f25342ff0d56f71c94cba22ef18a5","datavalue":{"value":{"entity-type":"item","numeric-id":735650,"id":"Q735650"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2367804$88AEF99A-FD5A-463A-BEE7-BD34242955F3","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":"Q2367804$6B912B0D-CA8D-40DD-86A4-73584548E1B1","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"6b40146f7bbd5f35c5f6ac1ea390440c306725af","datavalue":{"value":"https://doi.org/10.1006/jmaa.1993.1130","type":"string"},"datatype":"url"},"type":"statement","id":"Q2367804$6993D9A9-F9F2-4B0D-85EC-2C1BDE468AD8","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"a51c682adace37a1283ff03d8e5fe1a3ade3c4cc","datavalue":{"value":"W2046287848","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2367804$2FA5758D-973A-4C68-843D-6CEBBD652139","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"ead44cb6329a58aca62d04b186c347c72b762327","datavalue":{"value":"10.1006/JMAA.1993.1130","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2367804$84A74BE0-AB34-46D5-A9DA-B8F76252B64F","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"8f2c79898e1dd9163122efd70470721aed4a6435","datavalue":{"value":{"entity-type":"item","numeric-id":5383628,"id":"Q5383628"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"8fd98cd30d358ea9583fd6898e735223a049d37a","datavalue":{"value":{"amount":"+0.7512053847312927","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":"Q2367804$D39F26B2-AEB5-4A06-93C7-5D25D7883B01","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"5646f56e20cb851c63fcc2014534b9ad93297a78","datavalue":{"value":{"entity-type":"item","numeric-id":4465006,"id":"Q4465006"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"cb420d752c05f5389b78b66393a7cdd0f033b054","datavalue":{"value":{"amount":"+0.7492277026176453","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":"Q2367804$2DEC1327-B9EA-40D7-A926-278FD903B621","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"04245b5bf3270953cfda604bc6a82747a35e8ff0","datavalue":{"value":{"entity-type":"item","numeric-id":3780755,"id":"Q3780755"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"ff6c560eb23d954b91995c64127ad1bc9f4fa3d7","datavalue":{"value":{"amount":"+0.7414833903312683","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":"Q2367804$EEED1175-1EB9-4969-B65A-BA4E2997094B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"52fa5b6dea48adab1ef45fae635e6c4a2c753448","datavalue":{"value":{"entity-type":"item","numeric-id":5931156,"id":"Q5931156"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"c3bea5cd5eec20aa804b43cff637680f612d8613","datavalue":{"value":{"amount":"+0.7253405451774597","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":"Q2367804$F76568A7-5B98-480F-97F4-B4BA0E623EAC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"5a7a09bdd98e3f1a02b482d383ea8228c9cf4b81","datavalue":{"value":{"entity-type":"item","numeric-id":3811600,"id":"Q3811600"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"2aa4cefbc7c3391f2327c2888a34a918ec51be92","datavalue":{"value":{"amount":"+0.721173107624054","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":"Q2367804$2B54219F-08AA-4F13-8F4A-E45B4CB1C70C","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An inequality sorting algorithm for a class of linear programming problems","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_inequality_sorting_algorithm_for_a_class_of_linear_programming_problems"}}}}}