{"entities":{"Q1594423":{"pageid":1605163,"ns":120,"title":"Item:Q1594423","lastrevid":72280878,"modified":"2026-04-14T03:50:54Z","type":"item","id":"Q1594423","labels":{"en":{"language":"en","value":"The inverse problem for standard linear programming problems"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1557727"}},"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":"Q1594423$3C9ED0CC-E31F-4C7A-9245-50A801FBB3BC","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"32381290d1a0a41a95e7731d4a16c73e5a3093a9","datavalue":{"value":{"text":"The inverse problem for standard linear programming problems","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1594423$A76FA030-D2E1-484E-BC29-CC439134CD83","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"5933a3f556d39660d43ee2003b2d93bc36398058","datavalue":{"value":"0970.90051","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1594423$2888D44B-4359-49E4-A2F1-C2C80FABDB3B","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"6adb7e49519bbfa4f942bc9ed4ba3d3f1514064b","datavalue":{"value":{"entity-type":"item","numeric-id":1594422,"id":"Q1594422"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1594423$2AD7D473-2C57-4124-A432-859988FEFA40","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"2bbc31fcaa3dcf49d82403ba391044fdfb104e43","datavalue":{"value":{"entity-type":"item","numeric-id":161529,"id":"Q161529"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1594423$984DD6A0-B18B-411E-9579-5D41FB378548","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"0601000542f3e114e23706def63e518454cfab68","datavalue":{"value":{"time":"+2001-01-28T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1594423$A44D5D22-5A0D-4828-9629-7AE44DE52497","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"768e5a1e4aafb0ebae50bd0358a1c6eed21bafe4","datavalue":{"value":"The inverse problem for standard linear programming ones (SLPP) is solved. More exactly, fix a (matrix) triplet \\((A,b,C)\\) of the coefficients which determines a SLPP, and suppose that the corresponding canonical problem has a nondegenerate support optimal solution \\(X_0\\in \\mathbb{R}^{n+m}\\). The problem is to find the set of all canonical problems such that the first \\(n\\) coordinates of their nondegenerate basis optimal solutions equal the corresponding coordinates of \\(X_0\\). Three cases are considered depending on the structure (the number of positive coordinates) of the optimal solution \\(X_0\\). For each case the desired set (that equals the set of all SLPP with the optimal solution) is constructed in the explicit form and is parametrized by the given coefficients.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1594423$D3C57997-5564-4887-8665-F20A4C8C42C2","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"5814f1742557d27225f7edba253c420a5b1e9d32","datavalue":{"value":{"entity-type":"item","numeric-id":1566519,"id":"Q1566519"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1594423$BDEB83F0-C065-45D6-BC84-2E6E220494B3","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"63b70ec5cb69f5c5c9550409918141ca28bfae61","datavalue":{"value":"90C08","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1594423$CDD08F18-D563-4128-ABFC-24F551C79E35","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"395198e8ff78aff63d30c9eda38f86debae80eef","datavalue":{"value":"1557727","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1594423$B9390CD2-EB00-4F00-97F6-191115599144","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"23a5046cdac7a3de2f27e5b61e9bf86d91db8e9c","datavalue":{"value":"standard linear programming problem","type":"string"},"datatype":"string"},"type":"statement","id":"Q1594423$FF6866F4-1065-43A6-90BA-D0B2EBF14800","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f1267a15b8ae0f04dbc43b685500e681cf73c4a7","datavalue":{"value":"inverse problem","type":"string"},"datatype":"string"},"type":"statement","id":"Q1594423$161EA70D-B762-4680-AB94-FAC4FD541BE2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"311c918aa73c0095f25f775f111e8abd535d104e","datavalue":{"value":"optimal solution","type":"string"},"datatype":"string"},"type":"statement","id":"Q1594423$D9ED7342-7531-48FE-B803-09232BEAD9D3","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":"Q1594423$C0329402-B3E8-49F3-B0AB-D4D7FE61DA32","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"099a45531ac3fa5c2291361d7039d2f9bdd28254","datavalue":{"value":{"entity-type":"item","numeric-id":2396367,"id":"Q2396367"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"5994e04ad371c261f75d0c35878c3e4756686d39","datavalue":{"value":{"amount":"+0.8249019980430603","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":"Q1594423$EA944BEC-BE57-4723-8E00-5E2F8EBCF938","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"d8f26e8fb65ca26263e9fcaa95f70056d8ca0317","datavalue":{"value":{"entity-type":"item","numeric-id":1923457,"id":"Q1923457"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"c32da09fae87b2fd934cbd94b7868e9ff07db596","datavalue":{"value":{"amount":"+0.8160043954849243","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":"Q1594423$1D6D3360-D0BE-41BD-B13C-367C5C3D2477","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"a361e7eb6397bad880009619ba45ec7d167df15f","datavalue":{"value":{"entity-type":"item","numeric-id":2358169,"id":"Q2358169"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"fcf8a1702867fe9c460c4cee3002b01dd95e46f3","datavalue":{"value":{"amount":"+0.8139140605926514","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":"Q1594423$421D5C98-F0EF-4DD6-BBC5-F0E7EA533BF8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"ec13527590bbd37dba4c37dc7c627bd1b5f7e285","datavalue":{"value":{"entity-type":"item","numeric-id":1298792,"id":"Q1298792"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"f9aae57f499f58b40c367e0335b698908ba79201","datavalue":{"value":{"amount":"+0.8124394416809082","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":"Q1594423$E753B9A3-D4F4-4010-9D10-D4EF8A4A8C61","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"fe06b9290655f790b3718f0c91d41516df180de0","datavalue":{"value":{"entity-type":"item","numeric-id":495129,"id":"Q495129"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"280f62db490687779b995f6b3bc7c24b82717ea2","datavalue":{"value":{"amount":"+0.8099029660224915","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":"Q1594423$23EB409E-74C4-464A-9510-A4F66C693709","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"The inverse problem for standard linear programming problems","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/The_inverse_problem_for_standard_linear_programming_problems"}}}}}