{"entities":{"Q1567067":{"pageid":1577807,"ns":120,"title":"Item:Q1567067","lastrevid":67979286,"modified":"2026-04-12T20:37:48Z","type":"item","id":"Q1567067","labels":{"en":{"language":"en","value":"An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1455284"}},"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":"Q1567067$95161C99-0D12-4B75-98B0-A2617598FA8E","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"0a652bdb6928ef417381371c4efc3d7d7a93806b","datavalue":{"value":{"text":"An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1567067$1BFFD681-B305-4A42-9D01-4EB333A8E39E","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"c17f7178bccded38f38da4bd6e34dd9bf0d00219","datavalue":{"value":"0997.90078","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1567067$E66F3118-E3DA-4753-BCCF-934BB6757BE7","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"58699c90aebab531e892d3aa3ff151c662c384ae","datavalue":{"value":"10.1023/A:1008316429329","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1567067$137840B0-C540-41EF-91AA-BDE0A97EBBE3","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"19d81c26ce016ef34deee40bb4159c4490c99663","datavalue":{"value":{"entity-type":"item","numeric-id":229676,"id":"Q229676"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1567067$7EF30DB0-0ABE-4C08-8D6C-0607F7C688DA","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"8c9a1d032b4dee05705e8b2f4f60118816c12892","datavalue":{"value":{"entity-type":"item","numeric-id":116038,"id":"Q116038"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1567067$64AACA9E-A92C-48D3-8016-8B1A734F2C69","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"b296ecc9fb2c30a514c2239a7c726ce0b9568fb8","datavalue":{"value":{"time":"+2000-06-05T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1567067$AD602BA0-88FA-48AE-BFDE-537F1CC16A1B","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"940a467af9b52bbdec9916c3154fbbe743470091","datavalue":{"value":"The article under review is a valuable contribution to both theory and, in particular, numerical analysis of so-called convex multiplicative programming. By definition, in this field of nonlinear minimization the objective function is a finite product of convex functions over some compact convex set \\(D\\). Such a problem \\((P_D)\\) arises in economic analysis, portfolio and multi-objective optimization, and in VLSI design.    In order to solve this NP-hard problem with computational savings, the author bases his development of an approximate algorithm on an equivalent quasiconcave minimization problem, called outcome space problem \\((P_Y)\\).    Assuming \\(D\\) finitely convex and differentiably defined, the algorithm firstly implies outer approximation of the nonempty, compact outcome space \\(Y\\) by decreasing polytopes, found by a nonlinear convex program, resolution of a system of linear (in)equalities, and a ``cut off'' from one iteration to the other. Herewith, the algorithm works ``economized''. Secondly, we find branching and, thirdly, bounding techniques from linear programming, prepared by suitable notions and notations.    The author presents an (upon termination) finite convergence theorem to an \\(\\varepsilon\\)-optimal solution, and gives detailed computational issues. Finally, this carefully written investigation in global optimization becomes applied to a numerical example.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1567067$C8544404-524B-4FB9-8BBE-A266A715F397","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"265aa06de3c3ee132e8ea8a0742fd6340e3f72db","datavalue":{"value":{"entity-type":"item","numeric-id":317138,"id":"Q317138"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1567067$7CA8DFD9-1624-412C-845D-6FBA67FFD7B9","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"52de7d4bf5a27d5ad252804eec58396bb3e40c44","datavalue":{"value":"90C30","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1567067$7DA5783C-10C6-4367-B07F-F13BFB40D9FE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"955a6ac68db8c67c1772255c707ed5eb1d2bad2b","datavalue":{"value":"90C57","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1567067$C72E8C46-0139-4F2A-9112-A9191F3DDEED","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed10a41ec587cb61dc683f25ef4b3e827c7fee2f","datavalue":{"value":"90C26","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1567067$24B1A66B-6F2A-465E-A74A-29318A43418A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"0b4fa5b59eb6fe6e43618f9e005f4a49f4390971","datavalue":{"value":"65K05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1567067$784CC6E1-E4B1-43A1-8E90-5B08DEB77655","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"5f186cc211759b135ad722b649903d0007b8ca88","datavalue":{"value":"1455284","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1567067$323BAF7C-F448-4825-AAAE-6DD19F78A247","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"dfbcaaf2f1a9ac15831ae6c3d4dd30c7f84e33bb","datavalue":{"value":"branch and bound algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q1567067$BD74DA1E-C6EB-4314-8BCB-BD469B88975D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"02bf09070d235cccfd20c0065721421493c0c2fd","datavalue":{"value":"convex multiplicative programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q1567067$F8C5D745-D9A0-49D1-8019-8BB43AB0F57C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"79af53d4f1bdcf2d12a6d193f1c396a4f82fe4c0","datavalue":{"value":"quasiconcave minimization","type":"string"},"datatype":"string"},"type":"statement","id":"Q1567067$4C2A89E4-E377-4276-92F5-6E01E7494A6E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1be4887fd67f4a98752f694b3ee9b925aab5b271","datavalue":{"value":"outcome space problem","type":"string"},"datatype":"string"},"type":"statement","id":"Q1567067$F52D91E5-7D69-495A-ABCE-E6D0D866F38B","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":"Q1567067$62130935-2D0E-48CF-B6FB-0A2F97576E24","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"c569154150b52d218a74ce331b426cdd4078fb51","datavalue":{"value":"https://doi.org/10.1023/a:1008316429329","type":"string"},"datatype":"url"},"type":"statement","id":"Q1567067$1988A148-C524-4964-8B6F-56875CB43E0F","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"332c777b26c7c525a4d4f0f4eab2514b17a40533","datavalue":{"value":"W2280657913","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1567067$1941635C-9991-4274-8AEB-3654E6458DE2","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"30ce841f3190ba253caa47c3ba71ec9d8c34667c","datavalue":{"value":{"entity-type":"item","numeric-id":969745,"id":"Q969745"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"fb4f5621cf2d5aacb0b7bbecec334489ab914ea7","datavalue":{"value":{"amount":"+0.8623814582824707","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":"Q1567067$03140911-6244-43A5-AB50-92A06B6760F9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"2566e2463fda578fa1cbf0b74d8ae22d901c135e","datavalue":{"value":{"entity-type":"item","numeric-id":972168,"id":"Q972168"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"a20c2e2e81051ab47e4c8dccbf7d07b27cb6c21f","datavalue":{"value":{"amount":"+0.8587744832038879","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":"Q1567067$FDE96B0F-1621-43A9-8C2B-CE9F31B594A3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"9f693d54d7760963bfde1bf5fbd9db70bef54464","datavalue":{"value":{"entity-type":"item","numeric-id":934807,"id":"Q934807"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"c0ea233082c898592da01411b04bac2935f9846e","datavalue":{"value":{"amount":"+0.854794979095459","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":"Q1567067$DA9AC316-3306-4420-93B1-109E311511ED","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"3ebd51ca0bd72e37414f8a54f4840b1c0a0acdf2","datavalue":{"value":{"entity-type":"item","numeric-id":2942454,"id":"Q2942454"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"17ad813311b89c64ecfdf52919f40908100ca831","datavalue":{"value":{"amount":"+0.8519884943962097","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":"Q1567067$031E09E3-D223-4B61-85CF-FBA5E4A15DD1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"69a59735415e8370b86a2259f45cc7b7a425d3c4","datavalue":{"value":{"entity-type":"item","numeric-id":2250114,"id":"Q2250114"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"cc48255edbf939f0c61e85297dee593883e191f9","datavalue":{"value":{"amount":"+0.8502394556999207","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":"Q1567067$2CB43561-B133-47F3-9BB0-C01FA2E0F733","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_outcome_space_branch_and_bound-outer_approximation_algorithm_for_convex_multiplicative_programming"}}}}}