{"entities":{"Q2740700":{"pageid":2751439,"ns":120,"title":"Item:Q2740700","lastrevid":82972856,"modified":"2026-05-06T22:34:34Z","type":"item","id":"Q2740700","labels":{"en":{"language":"en","value":"An inner approximation method using a descent method for a reverse convex programming problem"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1647254"}},"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":"Q2740700$68704751-D1CE-478C-815E-0C8423488279","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"bd93414900df6438ba7694c8a7b5a08c9f882a97","datavalue":{"value":"0968.90505","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2740700$295C679C-14C1-4FF3-945E-BFE4A124F0C1","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"4637e489cc1833e1100c144ccee6ecc88878afd9","datavalue":{"value":{"time":"+2001-09-17T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2740700$76E22C43-DA6E-4E78-BA82-86DF1AEF527C","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ccd1dd4cefa81e8158b9f080486a4eaed61a9ee8","datavalue":{"value":"90C25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2740700$DA8D08B9-DFD5-46AD-BB79-71A701A25DF0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"15f4e876d21d5111ed972346cf4b55d9dc89f6a2","datavalue":{"value":"90C46","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2740700$D4B6F1BE-53E1-455D-92B8-4184ADE6FFF7","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"5e9b248dbf49f5b7b42438122a29187a4efbd814","datavalue":{"value":"1647254","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2740700$7CDAB278-82CD-4513-B2A5-E4DD0BDA659D","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"d61047e980378b7969ab150885f5fe8f56f988b3","datavalue":{"value":{"entity-type":"item","numeric-id":208959,"id":"Q208959"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2740700$64C2EEC8-B30D-468D-BCD2-67F0CF7AD096","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"843ad2e1eb425ff4a26499d18ec5697c90196aef","datavalue":{"value":{"entity-type":"item","numeric-id":439349,"id":"Q439349"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2740700$A0F74A97-F91B-4DCB-80B7-3F463CFE4AEF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"97645e3d324abd87f41b2deda696fde359f8ec62","datavalue":{"value":{"entity-type":"item","numeric-id":168097,"id":"Q168097"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2740700$87AB7E51-3646-4D2D-9007-0EDCEEC18CE2","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":"Q2740700$6B0A943D-A5EA-4EB9-B991-BFFDCD3D5D9E","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"49d9e7d6cb1485bbc7b0ebb05a9e79eb2e4cd4d5","datavalue":{"value":{"text":"An inner approximation method using a descent method for a reverse convex programming problem","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2740700$28810D96-DE5B-4A95-ADD5-F7C2E51F5CDF","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"1fa57fbabc9c9a9f93e18694454b754a27139fc3","datavalue":{"value":{"entity-type":"item","numeric-id":6767942,"id":"Q6767942"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2740700$D144574E-A911-4342-990A-E2FA44349BFD","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An inner approximation method using a descent method for a reverse convex programming problem","badges":[]}}}}}