{"entities":{"Q1089747":{"pageid":1100499,"ns":120,"title":"Item:Q1089747","lastrevid":66109224,"modified":"2026-04-12T07:37:12Z","type":"item","id":"Q1089747","labels":{"en":{"language":"en","value":"An algorithm for optimal resource allocation in systems with linear constraints"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 4005474"}},"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":"Q1089747$C95696EA-342B-408E-AA80-6E637C259287","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"e9e5f8bbe8ddbc6b9e0df696b6192bc641b4a40d","datavalue":{"value":{"text":"An algorithm for optimal resource allocation in systems with linear constraints","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1089747$88779EB3-C6FB-490D-8498-868110B1B988","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"afba29cc931f658220de41cb996673b5c75f74a5","datavalue":{"value":"0619.65051","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1089747$9DA11BBA-E9D1-4B92-A64B-F920CCE4BA97","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"e2eac48bcc72233c610ba3cf5422aa3b0a68d691","datavalue":{"value":"10.1007/BF02576907","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1089747$60DC3513-AFB0-4B89-8515-BCD7073E9DF9","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"628adbdb810888c60e3f972fee2839851c2903d2","datavalue":{"value":{"entity-type":"item","numeric-id":919258,"id":"Q919258"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1089747$A5ADC818-4D52-47B5-BBC0-02675C52E787","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"fa0ba58b3114d8fa3b465e5112e7eee5b47291c2","datavalue":{"value":{"entity-type":"item","numeric-id":260128,"id":"Q260128"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1089747$DF2E12D7-441D-46D6-BDDF-172558C595EA","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"63df7153432d81fa42019fcabb076c89649b0b5b","datavalue":{"value":{"time":"+1986-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":"Q1089747$F9EDC949-FE4A-492B-957C-B16A3BD32878","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"69556a73c5daae9ef3a1a6aabad29d918c017264","datavalue":{"value":"Dans cet article l'auteur examine la probl\u00e9matique de la gestion des ressources de diff\u00e9rents types, par exemple hydriques. A chaque instant t une fonction d'utilit\u00e9 \\(G_ t\\) est d\u00e9termin\u00e9e. L'auteur se propose d'\u00e9laborer une strat\u00e9gie, solution d'un probl\u00e8me qui revient \u00e0 maximiser une somme finie de valeurs de la fonction d'utilit\u00e9 pour \\(t=1,2,...,N+1\\). Soit \\(D_ t\\) le d\u00e9bit \u00e0 l'instant t, il existe des constraintes comprenant l'\u00e9quation de continuit\u00e9 du syst\u00e8me \\(X_{t+1}=g(X_ t,D_ t,Q_ t)\\) ainsi que des limites op\u00e9ratives sur les d\u00e9bits et des limites physiques sur l'emmagasinage; la variable \\(X_ t\\) correspond \u00e0 ce dernier. \\(Q_ t\\) repr\u00e9sente l'afflux au d\u00e9p\u00f4t au temps t.    En vue du calcul d'une strat\u00e9gie optimale, l'auteur propose un algorithme qui est neuf et qui poss\u00e8de plusieurs qualit\u00e9s requises: il est simple et op\u00e8re sans la discr\u00e9tisation de la variable d'\u00e9tat. En outre il ne demande pas trop de m\u00e9moires. L'algorithme converge de fa\u00e7on monotone en \\((N+1)\\) pas au plus, N d\u00e9signant le nombre de phases et est efficace pour le calcul num\u00e9rique. Le domaine d'application de l'algorithme est limit\u00e9 comme suit: l'\u00e9quation d'\u00e9tat est lin\u00e9aire et le probl\u00e8me examin\u00e9 est \u00e0 une dimension. D'autre part celui-ci est en sorte, du point de vue formel, un cas particulier d'un certain probl\u00e8me (\\({\\mathcal P})\\), qui a \u00e9t\u00e9 trait\u00e9 dans le cas lin\u00e9aire par \\textit{V. Levis} [Calcolo 1, 299-336 (1964; Zbl 0138.163)].    Soit \\({\\mathcal D}\\) l'ensemble des strat\u00e9gies D admissibles, c'est-\u00e0-dire de celles qui satisfont aux contraintes impos\u00e9es. L'auteur d\u00e9montre une condition n\u00e9cessaire et suffisante d'existence d'une solution, un r\u00e9sultat se rapportant \u00e0 l'unicit\u00e9 de celle ci est \u00e9nonc\u00e9. En vue d'\u00e9tablir un algorithme d\u00e9terminant une strat\u00e9gie optimale, l'auteur traite d'abord le cas lin\u00e9aire. Pour V t fix\u00e9, il suppose que \\(G_ t(\\cdot)\\) est une fonction affine de x, \\(x\\in R\\). Etant donn\u00e9 \\(D\\in {\\mathcal D}\\), il envisage la suite temporelle des stockages minimaux, qui rendent possibles le d\u00e9bit \\(D_ t\\) au temps t; cette suite est d\u00e9finie au moyen d'une relation de r\u00e9currence. Comme chaque strat\u00e9gie optimale distribue le volume maximum de ressources, les strat\u00e9gies ayant une norme maximale dans \\({\\mathcal D}\\) vont \u00eatre caract\u00e9ris\u00e9s.    Au cas o\u00f9 la fonction d'utilit\u00e9 est concave et lin\u00e9aire par morceaux, l'auteur utilise une proc\u00e9dure typique de la programmation lin\u00e9aire. Dans le cas g\u00e9n\u00e9ral il fait l'hypoth\u00e8se que \\(G_ t\\) est une fonction non d\u00e9croissante, qu'il convient de supposer concave dans les applications. La fonction \\(G_ t\\) est approch\u00e9e par une suite de fonctions polygonales appropri\u00e9e. Apr\u00e8s avoir d\u00e9montr\u00e9 un th\u00e9or\u00e8me de convergence, l'auteur pr\u00e9sente le trac\u00e9 de l'organigramme se rapportant \u00e0 l'algorithme et traite un exemple num\u00e9rique.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1089747$421859C9-A84B-4E19-A4FD-8D5E2060E449","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"5a06b542cc92c92ff7ecb1c6f1b0395c7d886840","datavalue":{"value":{"entity-type":"item","numeric-id":789151,"id":"Q789151"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1089747$54805475-32A4-4598-BC59-20E96EC44693","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"0b4fa5b59eb6fe6e43618f9e005f4a49f4390971","datavalue":{"value":"65K05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1089747$F6DF51D1-E024-48A6-B69D-02A279CC7925","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"662a15c969a3e9b9201184d54187bd341d8c9f5f","datavalue":{"value":"91B16","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1089747$CF5B91E3-D585-4E34-B8D7-809D583832DA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ccd1dd4cefa81e8158b9f080486a4eaed61a9ee8","datavalue":{"value":"90C25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1089747$020133DD-B6C5-4680-B5E8-9A47BA560217","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"eda8498c020fdb05565d8dbc99b416b5405f0bfc","datavalue":{"value":"4005474","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1089747$1E75F386-527D-482B-A1B0-A316510ABCED","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"8a9e1ca73cfd8391683d9d4ae36fc1c4b82fa6b3","datavalue":{"value":"optimal resource allocation","type":"string"},"datatype":"string"},"type":"statement","id":"Q1089747$DD06B668-DBB4-4E05-8685-A5139383AF95","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"80bb3c8ef52d10c28833672bce019d4fa6ab553b","datavalue":{"value":"minimal storage requirements","type":"string"},"datatype":"string"},"type":"statement","id":"Q1089747$33D61035-2248-4AA6-BF2F-7E43B7C025BC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0d82cfa81638332a8c825bcbbd9d7f7f9c0c45be","datavalue":{"value":"dynamic programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q1089747$63880C65-C3BE-4232-94BA-FAA6DD4E3F4D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"03ee0109af41ad406ecd743518061baaa9e5e3ff","datavalue":{"value":"convergence","type":"string"},"datatype":"string"},"type":"statement","id":"Q1089747$2CDD5C34-D95A-4234-B951-5EEB2C6C9E81","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"9c7501ea4eb7072ede52e9ca451b0b4a435fc405","datavalue":{"value":"optimal strategy","type":"string"},"datatype":"string"},"type":"statement","id":"Q1089747$EAC27660-DC13-48AC-BB8C-31EBC248A2B6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0c43814e02c575240ce973ea8bba5c35955fda28","datavalue":{"value":"systems with linear constraints","type":"string"},"datatype":"string"},"type":"statement","id":"Q1089747$A599EF17-F3BB-4E58-96FF-D673E2281CA8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"48ddf43eca498c7e7087cd696beb82ea63925320","datavalue":{"value":"algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q1089747$45C07157-27AF-4994-BDB3-1B52D1DA3826","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"75f7fe19f725521885c5a40b8a361664ab1a2991","datavalue":{"value":"efficiency","type":"string"},"datatype":"string"},"type":"statement","id":"Q1089747$8C70A3D5-B722-40C2-8044-93B4F136826A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"b1303defec8a56fb3a1dbb553a2bf79f1b7ac094","datavalue":{"value":"utility function","type":"string"},"datatype":"string"},"type":"statement","id":"Q1089747$61366D22-A837-41FF-86D4-BAF84A1AF89F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"956a813597a883282d6b2012e9c0006f5730225c","datavalue":{"value":"stockage","type":"string"},"datatype":"string"},"type":"statement","id":"Q1089747$288DA2EC-EAEA-4E96-B0F5-6325228530AB","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":"Q1089747$474BFD65-3F27-4CFB-B1C2-E6902441AFEA","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"10a361b99a125f92d7fcf484a19582b46266c87e","datavalue":{"value":{"entity-type":"item","numeric-id":4673630,"id":"Q4673630"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1089747$06260563-1008-4B1A-A89F-1A02DB22AAF1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"6a860092cae4ad4c5ee631c0a98f0a7ee7f9c9d0","datavalue":{"value":{"entity-type":"item","numeric-id":3241581,"id":"Q3241581"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1089747$A6371604-53C3-4642-8538-EA0F8E1C0A58","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"692ec6b394644d886e9b1073ef4594789f55fd0b","datavalue":{"value":{"entity-type":"item","numeric-id":3286740,"id":"Q3286740"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1089747$B6DB30DB-B80E-48B3-A149-9D77789BDB85","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"803dd822210f8b4c85971a2c9a3b42fb80a8bdc6","datavalue":{"value":{"entity-type":"item","numeric-id":4743352,"id":"Q4743352"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1089747$21487D21-CB27-44E8-9C92-CACA19DD25B4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"e5253bc8ee8b327ddf0449e0065de71d2e7ffc12","datavalue":{"value":{"entity-type":"item","numeric-id":2558828,"id":"Q2558828"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1089747$9D27EEF5-555E-4139-B2ED-3D1BA7121074","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"c8e318acf70580ca71f5ecc43298772a81958064","datavalue":{"value":{"entity-type":"item","numeric-id":5569991,"id":"Q5569991"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1089747$F3EEF1FD-18AF-418D-8B31-0EEFCC1384BF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"af1cb1898224bdd901e519e4e0520b005a8751d5","datavalue":{"value":{"entity-type":"item","numeric-id":4071041,"id":"Q4071041"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1089747$D7DD35DD-0FC0-491F-AB70-9DE362359F67","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"db50713473155f38507345a1cf81818c1234c6cc","datavalue":{"value":{"entity-type":"item","numeric-id":2544549,"id":"Q2544549"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1089747$3FAB8B8D-22D6-4215-993F-C7F411B1C5ED","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"982be7951c7bc119f13e46f6ac0aa04fb6558a81","datavalue":{"value":{"entity-type":"item","numeric-id":2521895,"id":"Q2521895"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1089747$F118CD3E-B681-43D0-8F0D-2B048C23350C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"2bd639f722dda527730a6ba3d22bf6327259d91f","datavalue":{"value":{"entity-type":"item","numeric-id":3285814,"id":"Q3285814"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1089747$F033284A-4781-409C-AEFC-06D2A496A8B0","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"23475f4244f103d8989d0fc7d1cadaa54c072294","datavalue":{"value":{"entity-type":"item","numeric-id":788639,"id":"Q788639"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"33224d0a55d0d2c572a10ece7da466a9b6b30dbc","datavalue":{"value":{"amount":"+0.755067765712738","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":"Q1089747$A334DD7E-F6B6-475C-AD5A-DBF564B99D6E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"54bae9bc10895f85e1dce0a45d42604400167ac3","datavalue":{"value":{"entity-type":"item","numeric-id":2544549,"id":"Q2544549"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"c55c85211b6bd97543e9c18b60fcb0013c246e4b","datavalue":{"value":{"amount":"+0.7528971433639526","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":"Q1089747$BC9DB50F-C810-41B1-9584-92F20ADD76A6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"5fd18153b206f2f86e0e100720b922bb493867c8","datavalue":{"value":{"entity-type":"item","numeric-id":3342211,"id":"Q3342211"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"9fa91eac5cec1cd4bc5d24bec849bfdd7760af1d","datavalue":{"value":{"amount":"+0.7488491535186768","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":"Q1089747$A1200386-07C6-429F-AC6C-82E18C1E05B1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"a28f30136b4da76efa01332d990b2ec0da1f3e24","datavalue":{"value":{"entity-type":"item","numeric-id":2898092,"id":"Q2898092"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"da4c1eebf9ea3ece31ada52b81843535f5b4e2fd","datavalue":{"value":{"amount":"+0.7484325170516968","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":"Q1089747$5C7C184D-07D0-472B-9EEB-47D13096B207","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"47dd354300c7386d2611d1d11fe92f4e097f0abe","datavalue":{"value":{"entity-type":"item","numeric-id":3945943,"id":"Q3945943"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"b9a50924c346ccc37188790b562cf0d3d086c437","datavalue":{"value":{"amount":"+0.7476016879081726","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":"Q1089747$45F08847-C4FC-45B5-93B0-5C567A3D544F","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An algorithm for optimal resource allocation in systems with linear constraints","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_algorithm_for_optimal_resource_allocation_in_systems_with_linear_constraints"}}}}}