{"entities":{"Q1635378":{"pageid":1646119,"ns":120,"title":"Item:Q1635378","lastrevid":68032293,"modified":"2026-04-12T20:59:34Z","type":"item","id":"Q1635378","labels":{"en":{"language":"en","value":"An interior boundary pivotal solution algorithm for linear programmes with the optimal solution-based sensitivity region"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 6881328"}},"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":"Q1635378$09B82D4B-D2EF-46B4-BC1F-D019C4E20ABF","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"f09b5decf4c89d0b9aae2d75b25a92ff4dbca4d8","datavalue":{"value":{"text":"An interior boundary pivotal solution algorithm for linear programmes with the optimal solution-based sensitivity region","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1635378$0404B41E-0D4B-4E20-AC5E-476C9B7C3B77","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"5b69245179ecb8e1c1ea5f6bded7c8ed6c2cc319","datavalue":{"value":"1390.90528","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1635378$4239419C-B452-4A19-AA37-7D146E71A0E5","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"53ac83006a68d27d9b70f13b64593e7ee89d22b4","datavalue":{"value":"10.1504/IJMOR.2013.057489","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1635378$C76AF8DB-A4F3-41DB-9DC9-1E81847C7E47","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"d94f02aba7e770bad2bee1f0de2e6c6c4826f607","datavalue":{"value":{"entity-type":"item","numeric-id":1334617,"id":"Q1334617"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1635378$F7F56146-2D53-4C30-BDC5-DC08E0470F60","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"68261b3b180c23ceab6ee77f235ef2ca708b76bb","datavalue":{"value":{"entity-type":"item","numeric-id":961466,"id":"Q961466"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1635378$1C4152D3-F405-4ED2-B919-B47D429E2A51","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"08904a7410b5f731fa63153720439160d216b374","datavalue":{"value":{"entity-type":"item","numeric-id":548461,"id":"Q548461"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1635378$A7AFF86D-8D7A-4952-976A-5D37DBF8AA31","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"49b4abf9414d9a519347f1828f2d7ff45619ef9e","datavalue":{"value":{"time":"+2018-06-06T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1635378$3032A8B2-5458-40A7-A3B1-6B61542E4D56","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"036c7518232934a2de3f4c4a2b2c025c74eea2b4","datavalue":{"value":"Summary: We have developed a full gradient method that consists of three phases. The initialisation phase provides the initial tableau that may not have a full set of basis. The push phase uses a full gradient vector of the objective function to obtain a feasible vertex. This is then followed by a series of pivotal steps using the sub-gradient, which leads to an optimal solution (if exists) in the final iteration phase. At each of these iterations, the sub-gradient provides the desired direction of motion within the feasible region. The algorithm hits and/or moves on the constraint hyper-planes and their intersections to reach an optimal vertex (if exists). The algorithm works in the original decision variables and slack/surplus space, therefore, there is no need to introduce any new extra variables such as artificial variables. The simplex solution algorithm can be considered as a sub-more efficient.  Given a linear programme has a known unique non-degenerate primal/dual solution; we develop the largest sensitivity region for linear programming models-based only the optimal solution rather than the final tableau. It allows for simultaneous, dependent/independent changes on the cost coefficients and the right-hand side of constraint. Numerical illustrative examples are given.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1635378$57C3054A-F232-4C45-9F64-177BA823B513","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"82a006ec5bbbadf5f063bfdc770a07a4120063ab","datavalue":{"value":"90C31","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1635378$810950B5-821E-4A3D-8C74-8ED0D7B55E72","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"36d142e7ea03446b1d7deb9627eedb9f0297f86a","datavalue":{"value":"90C05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1635378$7F7C10C8-ECE9-47A1-A465-775162D8CC8A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"15f4e876d21d5111ed972346cf4b55d9dc89f6a2","datavalue":{"value":"90C46","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1635378$311CA1D9-310B-4B57-8EA9-57E6CF4F5D3A","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"1cec0baba5c98f9fd041c8c8b70f6929322b80b1","datavalue":{"value":"6881328","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1635378$E2366B74-C4AA-4761-ACE3-71A3AA984C6D","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"a08efa1a08a750d06fca0196004a17a02a35c592","datavalue":{"value":"linear programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q1635378$318BA682-6777-44B8-9D52-1997135E09ED","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"4fbc3ae9857e6172fc1a5799fcf76443855dfa22","datavalue":{"value":"full gradient simplex algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q1635378$590BD3B9-E652-4A99-8A67-775BF6CEF5C6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"add38fabd16698e0816d935b357d9c2f4b57dd6c","datavalue":{"value":"artificial-free","type":"string"},"datatype":"string"},"type":"statement","id":"Q1635378$8EBE41AB-B016-4948-B745-4012023D9F15","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"077ebf600c02d36bdca41644984b1dba1ba0378c","datavalue":{"value":"pivoting algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q1635378$5E2AEB0E-0471-4125-B522-CF3213CDDBA3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"87d806dfd930b8a247d784d7101ab37c0ad0cd5a","datavalue":{"value":"feasible direction method","type":"string"},"datatype":"string"},"type":"statement","id":"Q1635378$7CC8F6A4-51F1-4EC2-B429-D9F2EACE48A2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"c33df7aef31c3b72f79a402d631533e4d3e73e5d","datavalue":{"value":"simplex standard-form free","type":"string"},"datatype":"string"},"type":"statement","id":"Q1635378$21DE76A8-B950-4818-81D2-075443CB8ABE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"82a957d607c0b9dbc60bcba0d3dab8071c008301","datavalue":{"value":"big-M free","type":"string"},"datatype":"string"},"type":"statement","id":"Q1635378$91B376A6-A771-41FC-9BF2-0B6C2CB10E73","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"7e364c5798ac623142e34eec5babb111bbd86804","datavalue":{"value":"largest sensitivity region","type":"string"},"datatype":"string"},"type":"statement","id":"Q1635378$F1BEE3AC-65E0-4492-A3BC-A2A18B78D00F","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":"Q1635378$1E7FE0F3-DB2D-4C4A-A8DB-6A5EBA665877","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"3dd3055c65f5f657ee6fc55b0176f8a250e82ed8","datavalue":{"value":"https://doi.org/10.1504/ijmor.2013.057489","type":"string"},"datatype":"url"},"type":"statement","id":"Q1635378$AA3A8C6F-A6C0-49CF-8535-221608F51E3D","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"9f72e492777999aa8f20ffeaacf72386bc2efe12","datavalue":{"value":"W2056543148","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1635378$D9F1018D-256B-4741-99D5-518FAF24C882","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"7bbfd6295488c7d98e75de80a926f278f5c800d1","datavalue":{"value":{"entity-type":"item","numeric-id":2371471,"id":"Q2371471"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"8bdd6e9a423040badaf6d6d7e7d6b8f4f7919217","datavalue":{"value":{"amount":"+0.7907396554946899","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":"Q1635378$37F3AE20-BA3D-464A-B653-D424BD3852F6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"107c417f6836b623de56a99848028f11a5afc90a","datavalue":{"value":{"entity-type":"item","numeric-id":3537200,"id":"Q3537200"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"777472367a7912a8a760061b611dd716aec5f564","datavalue":{"value":{"amount":"+0.7545641660690308","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":"Q1635378$44D3E887-1DD0-42FE-860D-FA081A23735B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"cb6c05d9caf000dae39197d5d799d3f29c490d4e","datavalue":{"value":{"entity-type":"item","numeric-id":2383657,"id":"Q2383657"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"5db24413564f801db08499e2aeef8d789cd886b7","datavalue":{"value":{"amount":"+0.7471746206283569","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":"Q1635378$B0A4ED53-B3F0-41A8-852C-53F633C40A91","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"969344a636b4b6d16c9e5728d1a610be8c2fda92","datavalue":{"value":{"entity-type":"item","numeric-id":4950949,"id":"Q4950949"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"b5d29468b46936c42a80a06040f82d5a1defc272","datavalue":{"value":{"amount":"+0.7260852456092834","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":"Q1635378$B96B8686-DA4A-4AEB-BAB6-3632B6A0D4F2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"4ff5358018bdde4fb3562cbde59e675381745ba3","datavalue":{"value":{"entity-type":"item","numeric-id":1610185,"id":"Q1610185"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"527bd1b8443e7d5b1c797ed0728356b76c36bd19","datavalue":{"value":{"amount":"+0.7226870059967041","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":"Q1635378$97D0A901-173C-4247-A712-3DC217F9AE33","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An interior boundary pivotal solution algorithm for linear programmes with the optimal solution-based sensitivity region","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_interior_boundary_pivotal_solution_algorithm_for_linear_programmes_with_the_optimal_solution-based_sensitivity_region"}}}}}