{"entities":{"Q1165155":{"pageid":1175904,"ns":120,"title":"Item:Q1165155","lastrevid":69772536,"modified":"2026-04-13T09:17:08Z","type":"item","id":"Q1165155","labels":{"en":{"language":"en","value":"Relationship between bilinear programming and concave minimization under linear constraints"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3765537"}},"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":"Q1165155$F9638512-6152-4A0D-9206-ACA2286FAD7A","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"5e110be1c5b73692dc29768ad997a0340d89b114","datavalue":{"value":{"text":"Relationship between bilinear programming and concave minimization under linear constraints","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1165155$1526894D-D2FA-4B50-B81E-42B8D6DD7716","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"d19d51f79267bfd381f06d6671baecf7ad48fe54","datavalue":{"value":"0486.90061","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1165155$FC43A6EB-1962-456A-90CA-1705C2A459C7","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"24ac8496465bc06e203e8dcc59fbdc72ce8ec960","datavalue":{"value":{"entity-type":"item","numeric-id":201558,"id":"Q201558"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1165155$AE5DF2C4-44DE-4896-AE87-91820E43EB07","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"d115ebce9477b9eb1b678f4822a5db13260c4292","datavalue":{"value":{"entity-type":"item","numeric-id":201556,"id":"Q201556"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1165155$F1B74287-E074-46EA-AF18-5BB8EC24BA7F","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"56afe75e154439409929c71e0e459d1542811b6e","datavalue":{"value":{"time":"+1980-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":"Q1165155$D6E122AA-6F54-4896-8BE7-0F463CA18575","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"36d142e7ea03446b1d7deb9627eedb9f0297f86a","datavalue":{"value":"90C05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1165155$80A2162A-D13C-4442-804A-7CF62AD733C1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"78bd61792d92729e04574cd38c2ab8f5ce258568","datavalue":{"value":"90C33","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1165155$676A53FA-2E9C-44EF-8BBC-62E56BC6F4CD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed10a41ec587cb61dc683f25ef4b3e827c7fee2f","datavalue":{"value":"90C26","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1165155$294E6232-6698-432C-8CDD-89497A5D4A1A","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"401ea560495d1eb31ea7e8e37878cf53e4ccea84","datavalue":{"value":"3765537","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1165155$E70F22E0-10EA-4E73-9967-FE8B1FED130E","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"bbdb1de184ce37d78e295effa5e0d7f00a7ca812","datavalue":{"value":"bilinear programming problem","type":"string"},"datatype":"string"},"type":"statement","id":"Q1165155$7D656A2E-0F93-4DAE-A047-F639A918508E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"b20c694d12395fdfb738280945d8a1ecb6152ae5","datavalue":{"value":"concave piecewise linear minimization problem under linear constraints","type":"string"},"datatype":"string"},"type":"statement","id":"Q1165155$DB01A156-58F1-4CD9-9622-5AD71921DA75","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f5c45c1c60b8aeb3e5305be2e8e02a92cb2a6984","datavalue":{"value":"convex linear complementarity problem","type":"string"},"datatype":"string"},"type":"statement","id":"Q1165155$7FC2884C-B652-45EA-97C1-E07914D46AD7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e05efa3474df24e0a53cb9708a5c49921f140589","datavalue":{"value":"equivalence of problems","type":"string"},"datatype":"string"},"type":"statement","id":"Q1165155$9794A3B4-C131-4071-92A0-A5F561ACC4BF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"24c3952e28de482f8cc1242688f33cb870cb3ad2","datavalue":{"value":"equivalent reformulation","type":"string"},"datatype":"string"},"type":"statement","id":"Q1165155$AA1449A0-417A-4B90-A4FC-2EB4FE1800E7","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":"Q1165155$541F27F0-5282-4751-A3C9-05AF951FFA16","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Relationship between bilinear programming and concave minimization under linear constraints","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Relationship_between_bilinear_programming_and_concave_minimization_under_linear_constraints"}}}}}