{"entities":{"Q5928429":{"pageid":8105231,"ns":120,"title":"Item:Q5928429","lastrevid":47592070,"modified":"2026-01-02T04:11:33Z","type":"item","id":"Q5928429","labels":{"en":{"language":"en","value":"A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1582636"}},"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":"Q5928429$0ADF823C-F099-469E-ADDE-73CCEA1CB05D","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"a163fc477dcf858061e26d10dffb8e3c5d4bef53","datavalue":{"value":{"text":"A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q5928429$209E60C9-6AE4-4311-954C-4BA4EE0407B9","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"a6c4d73fc7303c8597de9f4216121ee136f277d1","datavalue":{"value":"0971.90065","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5928429$F89E772B-43F7-4AAF-90E4-09ADE5766281","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"cb3d815b1765fd597f643c751d25924123691e36","datavalue":{"value":"10.1023/A:1008314922240","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5928429$793D3C7A-E59F-4B6A-A053-1F1C9C835360","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"42727722603a9a6e6cbb9a7672ab520a195b0dd0","datavalue":{"value":{"entity-type":"item","numeric-id":168227,"id":"Q168227"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5928429$FC091895-A805-46AD-BFA4-2D8C5EDBA396","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"2455acc8a36674565d8a24d98fb6d83a362f8e19","datavalue":{"value":{"entity-type":"item","numeric-id":168228,"id":"Q168228"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5928429$170D4D9B-7471-41A4-902D-CF450536AABE","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":"Q5928429$14C4CA7D-F85C-4B1F-80A6-5F58E5F92E3C","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"910b748a15c45cd335bff2eb974340b10444976e","datavalue":{"value":{"time":"+2001-03-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":"Q5928429$C96BF36B-B671-4B3C-AF87-0479F8FEEEEF","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"98b7b737ba2d52a314c5f384b60020e2c0ae1864","datavalue":{"value":"The authors suggest a branch-and-bound algorithm for solving nonconvex optimization problems, the set of feasible solutions of which is a convex polytope \\(X\\) in \\(n\\)-dimensional Euclidean space \\(\\mathbb{R}^n\\); the objective function of these problems has one of the following forms:  \\[ \\sum^p_{j =1} (c_j^Tx+c_{j0}) (d^T_jx+d_{j0}) \\tag{1} \\]   \\[ \\sum^p_{j=1} (c_j^Tx+ c_{j0})/ (d_j^T x+d_{j0}) \\tag{2} \\]  where \\(c_j,d_j,x\\in R^n,c_{j0}, d_{j0}\\) are given real numbers and \\(p\\) is supposed to be low. It is necessary to find \\(x\\in X\\), which minimizes (1) or (2) over \\(X\\). The problem of minimizing (1) subject to \\(x\\in X\\) is called rank-\\(p\\) linear multiplicative programming problem, the problem of minimizing (2) subject to \\(x\\in X\\) is called rank-\\(p\\) linear fractional programming problem. The branch-and-bound algorithm for solving these problems is described and experience with computational experiments is presented.","type":"string"},"datatype":"string"},"type":"statement","id":"Q5928429$250218EE-02A0-43CF-BAAD-23F47268A0CE","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"ede5e36d99765c94dd5c6a42dd41c767ba4453ac","datavalue":{"value":{"entity-type":"item","numeric-id":300797,"id":"Q300797"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5928429$DC0DFC92-4732-4853-AE2B-F46EB7FE3086","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed10a41ec587cb61dc683f25ef4b3e827c7fee2f","datavalue":{"value":"90C26","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5928429$32A2E35E-446E-4826-B1BD-733D9AAA33E4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"3f4043530c5f766fce7f22c6a8360848f2544197","datavalue":{"value":"90C32","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5928429$FE1C2DBD-1C47-483B-B445-9EE72E9F7C3C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"52de7d4bf5a27d5ad252804eec58396bb3e40c44","datavalue":{"value":"90C30","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5928429$AE27DCED-EBFC-40B9-93C8-8EB0D031AA6D","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"9abc66a046b13a1b6a5727a7619b04c301ab9d27","datavalue":{"value":"1582636","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5928429$C94B3F09-80D4-44DA-8F6C-39817F5B024F","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1c92a84e9ecdb9c3a45ddeeada5834981b3665ba","datavalue":{"value":"linear multiplicative programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q5928429$53A98370-EE7A-4DA4-9E5D-82282CA350C4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"9c2df4be61b42c15be02a284667cc79d17284cd8","datavalue":{"value":"global optimization","type":"string"},"datatype":"string"},"type":"statement","id":"Q5928429$FE644442-98C0-4D5C-A14F-A61635662EF8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"bf54e2d199641bd16db964256732a9040fd52c2f","datavalue":{"value":"branch-and-bound algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q5928429$AC216833-54C5-487C-B81E-150A15AA078A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"4287c4bd9c92ecd352ae726f196f62740d829563","datavalue":{"value":"nonconvex optimization","type":"string"},"datatype":"string"},"type":"statement","id":"Q5928429$AA830375-ACEB-44E4-A4CD-8D87EE3A27B2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"c74aaaa533ab8c65a8b228034139d74a8066bb8c","datavalue":{"value":"linear fractional programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q5928429$ECFD9F5D-E4A6-40DA-B153-6D0B71CAD17E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"8c66d831f1b7a99700a8a583fdbec9044941e966","datavalue":{"value":"computational experiments","type":"string"},"datatype":"string"},"type":"statement","id":"Q5928429$75B80850-90C1-4E8A-972D-DDE17B161F42","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":"Q5928429$8D6D7F70-4C06-4953-BE34-F1032C45055D","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"ad6f0baa957ab1ab2eb3308b870d74c392228596","datavalue":{"value":"https://doi.org/10.1023/a:1008314922240","type":"string"},"datatype":"url"},"type":"statement","id":"Q5928429$A0748154-59BD-44F5-8782-BC489425080E","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"24d2e9e6faea338d293273925bad43b4eb7ae167","datavalue":{"value":"W36747366","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5928429$815324FC-FF71-4AB9-9253-DDE20056AA0A","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"44a919148ee91dfac27e88763d1fa700aef14cf9","datavalue":{"value":{"entity-type":"item","numeric-id":5947146,"id":"Q5947146"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"e0ac7f74a0bffc43550494e802b21dcb087db47c","datavalue":{"value":{"amount":"+0.8714051842689514","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":"Q5928429$6C895ABA-DE38-4FEF-B474-42396E26EC78","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":"0ffbb330f4845aa1e09a6b40825407dd5cb58031","datavalue":{"value":{"amount":"+0.8294693827629089","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":"Q5928429$C324F9A1-0DC8-469F-93C8-CFB79CA1DD1D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"aa2a772b1f030e8f94f09dd3b789c43b4b35ce91","datavalue":{"value":{"entity-type":"item","numeric-id":865505,"id":"Q865505"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"486295001f945c96ed70c99a8d19f9bdd3ed015f","datavalue":{"value":{"amount":"+0.8235016465187073","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":"Q5928429$C7FEAB27-0920-4E0D-BA9A-9F2708640432","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"6ca3c6fbca5e1ee2906b26ecb140f4ef9448354d","datavalue":{"value":{"entity-type":"item","numeric-id":5382214,"id":"Q5382214"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"7e609d58570004df07f5fb040b73cd07b8ea67ff","datavalue":{"value":{"amount":"+0.8231542706489563","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":"Q5928429$8042722C-C6F1-4892-8884-85AC0865ADD2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"1900f240f00aa3505e0ca294c636aef28c7b3f68","datavalue":{"value":{"entity-type":"item","numeric-id":5860790,"id":"Q5860790"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"0487d508c8fe1ffd5d4321538f160407810225a1","datavalue":{"value":{"amount":"+0.8225964903831482","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":"Q5928429$F9D836D0-832D-437D-A729-656121EF45AC","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Publication:5928429","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Publication:5928429"}}}}}