{"entities":{"Q5928735":{"pageid":8105537,"ns":120,"title":"Item:Q5928735","lastrevid":97611098,"modified":"2026-06-05T15:05:45Z","type":"item","id":"Q5928735","labels":{"en":{"language":"en","value":"Constraint aggregation method in a stochastic programming game problem"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1583604"}},"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":"Q5928735$84FB6CB7-2CEE-42A9-BF8D-C608BEDA678D","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"f086d20b0bbc9990c7792c583a29b1c24ed762e6","datavalue":{"value":{"text":"Constraint aggregation method in a stochastic programming game problem","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q5928735$58A1B97D-1A87-4BE9-BBCE-C2F1DF2E4777","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"39c0c61f58a04057a7a9e11aa330e8ae39c8e520","datavalue":{"value":"0997.90051","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5928735$B9E33466-8D7E-480D-8DDD-44127FADB042","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"d5d1ed738e82606f56b7a66e56fa6ad58456faa6","datavalue":{"value":{"entity-type":"item","numeric-id":914519,"id":"Q914519"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5928735$84F36978-1867-4AA1-9B15-1F3C41B88E09","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"b0812943399d39aa434ed0cb4df9940bd1d336d6","datavalue":{"value":{"entity-type":"item","numeric-id":1680110,"id":"Q1680110"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5928735$2698BD4F-88D3-4813-9CE7-7C1B15F3811C","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"aa4e0e353121dae82cdaefca14a62dc9d4bb34af","datavalue":{"value":{"entity-type":"item","numeric-id":163582,"id":"Q163582"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5928735$502DC6D6-0D34-41B9-97B4-3337D2E4339C","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"93a3dd362e41e70dae79c65c121f87f75a839644","datavalue":{"value":{"time":"+2001-04-02T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q5928735$8F39D79B-4A84-4CB0-897A-5D2D17912259","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"542680a80b2c9f7e8b4b1957a424174aaab12e00","datavalue":{"value":"The problem of searching for a value \\(F_0\\) and for the realization \\(x^0\\) of the minimum  \\[  \\min_{x\\in X}F(x), \\quad F(x)=\\int_Y \\max_{z\\in Z}f(x,y,z)\\sigma dx, \\tag{1} \\]  where \\(X,Y,Z\\) are compact sets in the Euclidean space, \\(\\sigma\\) is a probability measure on \\(Y\\), the function \\(f\\) is supposed to be convex on \\(x\\) \\(\\forall y\\in Y\\), \\(z\\in Z,\\) continuous and fullfilling the Lipschitz conditions on a set of variables, and integrable in relation to the measure \\(\\sigma\\) \\(\\forall x\\in X\\), \\(z\\in Z\\) is considered. The problem (1) is called a two-stage stochastic game problem with a recurrence. In operations research it corresponds to the problem of choice of the optimal strategy \\((x^0)\\) in presence of stochastic \\((y)\\) and indefinite \\((z)\\) factors. A reduction of problem (1) to a problem of maximization on a space of continuous functions and further to a semi-infinite optimization is proposed. The convergence of the method is investigated.","type":"string"},"datatype":"string"},"type":"statement","id":"Q5928735$9953210F-027D-4CC6-87BF-51913E548213","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"1339cd05034549bf98001b95bcc614fc651662c5","datavalue":{"value":{"entity-type":"item","numeric-id":586510,"id":"Q586510"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5928735$4B0AECC0-FD1E-465C-9057-E05EDF0A67F7","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"dade3bc82a2f7e555fdd92f6a7aa24c002fcafaf","datavalue":{"value":"90C15","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5928735$9DF9EB4A-2951-4BF3-B044-B7901FEF5EAB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"bc7eb0f462deb89a5bf6af1abf9a96ba13c81d67","datavalue":{"value":"91A40","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5928735$3B6BF357-8163-48CD-B801-D2288029F3B6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"8f34675a74b150d19473221b06b085ebc8156162","datavalue":{"value":"91A15","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5928735$FA59A122-D5CF-4B25-B0E1-B8CDC6520452","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"26e4d2663166ea6aa2e350b48da5cfb333192887","datavalue":{"value":"1583604","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5928735$5A5395A6-49A1-4B84-9D00-F47185DD5C09","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"fae617ea5679f75caf6a16478788cf8a9f773560","datavalue":{"value":"stochastic programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q5928735$44302BC5-C165-4030-8746-A6055792C526","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"3ac5259c725ad542f731444c5d578ab865844a5d","datavalue":{"value":"two-stage stochastic game-theoretic models","type":"string"},"datatype":"string"},"type":"statement","id":"Q5928735$9E6DD7A6-2C38-45BC-AA42-28575BE8C41F","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":"Q5928735$3D22C752-5C4C-4873-B3AA-EE792BD76BF2","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"f85bbb94e396124f1c5c22ac29d2d7598b95c892","datavalue":{"value":{"entity-type":"item","numeric-id":3320142,"id":"Q3320142"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"b39fd687fd9b2d79122d5cfd65028e64fea0c0cc","datavalue":{"value":{"amount":"+0.7828968167304993","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":"Q5928735$B4150077-FF0F-4CBD-B1B7-018D0B3EC319","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"b2c4bdf93abcf845ad88fa7115bf131d70dc1b44","datavalue":{"value":{"entity-type":"item","numeric-id":3475130,"id":"Q3475130"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"2045b24217ac4bbdf789f100780c818439c01a01","datavalue":{"value":{"amount":"+0.780842661857605","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":"Q5928735$0D4B3A8F-7674-4560-B984-352C881E864A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"7de46c4e8625d02c843ce3b371949acd45b84da7","datavalue":{"value":{"entity-type":"item","numeric-id":1348537,"id":"Q1348537"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"ee1bcacdd85cd471fe55e7bfb3cd9668e5ba8169","datavalue":{"value":{"amount":"+0.7740408182144165","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":"Q5928735$C0140FF7-7AD7-40E8-8995-B6181EDF1652","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"b7571eda5a7c8685b466ec7f29b8f2c486cabb85","datavalue":{"value":{"entity-type":"item","numeric-id":3496154,"id":"Q3496154"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"f4fa2dbc27a01e49c28f3d1a42e18f66c6eea2b0","datavalue":{"value":{"amount":"+0.7671272158622742","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":"Q5928735$2EBD4A50-ECCD-41A8-99E9-194A592614DB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"bb52caa7a5c25949d21758616c138982310a500b","datavalue":{"value":{"entity-type":"item","numeric-id":1176853,"id":"Q1176853"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"3fbdcad85cb34363fd492f147c4120c6df6bbbd4","datavalue":{"value":{"amount":"+0.7648197412490845","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":"Q5928735$CB16D4F7-6629-4EF6-A125-F7FFC4731DBD","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Constraint aggregation method in a stochastic programming game problem","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Constraint_aggregation_method_in_a_stochastic_programming_game_problem"}}}}}