{"entities":{"Q1060967":{"pageid":1071719,"ns":120,"title":"Item:Q1060967","lastrevid":66059232,"modified":"2026-04-12T07:15:44Z","type":"item","id":"Q1060967","labels":{"en":{"language":"en","value":"Linear programming with multiple choice constraints for single chain undiscounted Markov decision problems"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3910167"}},"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":"Q1060967$EFAC3BDB-735C-45AA-ABDF-91E1457EE647","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"cdf4bc674216f10e778fbe18975b51669aa424c0","datavalue":{"value":{"text":"Linear programming with multiple choice constraints for single chain undiscounted Markov decision problems","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1060967$B17B654D-B63F-414A-9F91-CDF42F35A1C1","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"658ce73df2ac8a607f3cbba67489ac0b6dabc50c","datavalue":{"value":"0569.90093","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1060967$20EDBB98-287D-4231-A972-C22268BB65CB","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"c3e846de25e91b5a55e3a855bb6271881106d8af","datavalue":{"value":"10.1016/0167-6377(85)90006-9","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1060967$AB4FA9E6-57C3-4D85-88EF-9C7D12B16BD0","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"075975966033814311bea49befd56c76e36b331b","datavalue":{"value":{"entity-type":"item","numeric-id":1055695,"id":"Q1055695"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1060967$8AEE15BE-FA12-4D71-B68A-783E6456ED34","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":"Q1060967$EBECD127-BA7D-4504-AD2E-67BA541027A3","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":"Q1060967$21156B09-165E-4144-A899-F70FD61FB1C6","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"631a78016a1282817d1168ae84e415d58140ad18","datavalue":{"value":"This paper develops an efficient LP algorithm for solving single chain undiscounted Markov decision problems. The algorithm imposes, in the framework of the simplex method, the multiple choice constraints that exactly one basic variable be chosen from each Markov state. It is proved that the algorithm converges to an optimal solution in a finite number of steps.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1060967$2D73D0F2-7410-43BA-A2A5-E29E4DAD8DEB","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"377d3ab03372cff12915e0de0374438ff70c3716","datavalue":{"value":"90C40","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1060967$1C86EFBB-921D-4EA0-BC47-646B42E531F1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"36d142e7ea03446b1d7deb9627eedb9f0297f86a","datavalue":{"value":"90C05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1060967$89836DF7-1AF6-40FE-8C32-1BF15B4221C4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"0b4fa5b59eb6fe6e43618f9e005f4a49f4390971","datavalue":{"value":"65K05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1060967$41F6B654-BE8D-467A-A0A2-5DED7BB93182","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"3c6738464224ff1bd733feb273785b26e23c33e8","datavalue":{"value":"3910167","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1060967$5523583E-B333-49CF-9EE3-1DC591F26C7A","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5ec9bc0fc44ca3646576bed566b5baa774a2083f","datavalue":{"value":"multiple choice constraints","type":"string"},"datatype":"string"},"type":"statement","id":"Q1060967$AFCAD7F7-3C79-46B4-B3C5-0C9EF51D41F6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e8d319c99fd8b741de9064f2305005e4f1c99aa7","datavalue":{"value":"finite state","type":"string"},"datatype":"string"},"type":"statement","id":"Q1060967$A3D85470-81E9-46C1-834F-D36357C4D1E8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1c7393b552ed3bef74dd7285ac7bfa2a63b3cdc1","datavalue":{"value":"single chain undiscounted Markov decision problems","type":"string"},"datatype":"string"},"type":"statement","id":"Q1060967$CFD86267-04EF-4645-B709-1E150D348700","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f6a9e644a062c5b7767e4219356e03dc48d7fb21","datavalue":{"value":"simplex method","type":"string"},"datatype":"string"},"type":"statement","id":"Q1060967$4E0B733C-7527-42E4-A9AE-E1E29CB39A21","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":"Q1060967$A76787C1-63DE-4985-8CF8-1730FB636D45","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"3d7137aac8fec5c4871941d51646672ede2bcbe9","datavalue":{"value":"https://doi.org/10.1016/0167-6377(85)90006-9","type":"string"},"datatype":"url"},"type":"statement","id":"Q1060967$5DC616EC-476B-4506-9A36-DB3491AFA986","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"17e3be980483c466ba54a0907a7e3df035ef85e9","datavalue":{"value":"W1969898762","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1060967$FC884DB2-3A5D-41AE-9FB1-C2F95ABAAFF5","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"b1d85d43ba1dc784584ae0a38a24d1bbdf8f2ed6","datavalue":{"value":{"entity-type":"item","numeric-id":3270185,"id":"Q3270185"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1060967$855B56B9-A580-4C54-8693-38ADDB604DD5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"7c1498284ac5e58d024bd813c64719bfffb2d427","datavalue":{"value":{"entity-type":"item","numeric-id":5585886,"id":"Q5585886"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1060967$994536B0-2360-4CA0-9AD6-A5A5974EB9CE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"0459d1a93a135deb9a3f3404173b887fd894a7be","datavalue":{"value":{"entity-type":"item","numeric-id":3266141,"id":"Q3266141"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1060967$C4751BF8-5DCD-4834-8C43-86D578354324","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"a8d2a4faa50410d408d52d2fdbd09e9080c4b7f4","datavalue":{"value":{"entity-type":"item","numeric-id":5566869,"id":"Q5566869"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1060967$E07B0FFA-5CDA-4DED-A48B-46295C18BBE0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"4048a9fd9c82333576b28ed6ab7722ed58950c70","datavalue":{"value":{"entity-type":"item","numeric-id":2768991,"id":"Q2768991"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1060967$675413EC-6C9C-48DF-A635-A31266CB6933","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"5378e22dc59801dba20f05969bd4ead3113ad148","datavalue":{"value":{"entity-type":"item","numeric-id":1055696,"id":"Q1055696"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1060967$8C086B24-367B-4C3D-90BD-2537BAC233E1","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"28061435bfdb422a382305423302c304eadb2a9b","datavalue":{"value":{"entity-type":"item","numeric-id":4861875,"id":"Q4861875"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"f74f664fa77466795e9024f4e4e35bcb5e1bad11","datavalue":{"value":{"amount":"+0.8530137538909912","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":"Q1060967$51110A6F-2939-4BCF-A1E4-771646B54058","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"9080c07510348e4ce07bcaf8b442e03cf4fd454d","datavalue":{"value":{"entity-type":"item","numeric-id":1075957,"id":"Q1075957"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"f74f664fa77466795e9024f4e4e35bcb5e1bad11","datavalue":{"value":{"amount":"+0.8530137538909912","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":"Q1060967$C5528BD3-FA08-43E9-902C-D2364B2DB8FA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"dbc16177a3e6d08ea6174bccb5a64b816bfee0a5","datavalue":{"value":{"entity-type":"item","numeric-id":1108203,"id":"Q1108203"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"60e4af7a754a19359466be094c95271d23d9fe72","datavalue":{"value":{"amount":"+0.8330351710319519","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":"Q1060967$AABD7528-4425-425B-AF08-134D7200A268","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"8e8e802f47577a0433805883dcbc685aa39f254e","datavalue":{"value":{"entity-type":"item","numeric-id":3220377,"id":"Q3220377"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"29569c6edf015ff723080b298bd25807a6443ab2","datavalue":{"value":{"amount":"+0.8229202628135681","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":"Q1060967$31BAFAA7-D17A-4D34-84AB-9FB8500D3693","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"28d937345f931143c9c4375f396fb9415067bcde","datavalue":{"value":{"entity-type":"item","numeric-id":1190392,"id":"Q1190392"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"3c58840e92bd1b39023d10b479d9c69d68821674","datavalue":{"value":{"amount":"+0.8183491826057434","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":"Q1060967$C08306AE-AD68-41DC-A764-2458249997D1","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Linear programming with multiple choice constraints for single chain undiscounted Markov decision problems","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Linear_programming_with_multiple_choice_constraints_for_single_chain_undiscounted_Markov_decision_problems"}}}}}