{"entities":{"Q4026720":{"pageid":6056479,"ns":120,"title":"Item:Q4026720","lastrevid":108228335,"modified":"2026-11-05T12:29:48Z","type":"item","id":"Q4026720","labels":{"en":{"language":"en","value":"A numerical algorithm for constraint optimal control problems with applications to harvesting. (With comments)"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 125077"}},"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":"Q4026720$F090C4D7-FDAE-41E1-A795-8E5A62737ADC","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"bc7e4454306e0c657d03d78ca4bcc8c69071090b","datavalue":{"value":"0768.65035","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4026720$9FAE60B5-97CC-4D40-B4B7-A96703404CF1","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"233a19660bd5f869bf67155dd4e98994cfbe90b1","datavalue":{"value":{"entity-type":"item","numeric-id":747047,"id":"Q747047"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4026720$52573409-15AD-4394-B70B-EA04557FFCFB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"fa06266c55a77a0ab16cbddbff6d324ef73ba17e","datavalue":{"value":{"entity-type":"item","numeric-id":481063,"id":"Q481063"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4026720$F9BB3597-DD36-459A-99BD-AC5B2C0C24A8","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"e89af0ab63fc0fca1fbd1433809f3667ad4723a1","datavalue":{"value":{"time":"+1993-02-21T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q4026720$310DE3D6-64E5-4062-BE06-AA1B561D9796","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"843de71235f44a800ae389e1734df6bb7650efec","datavalue":{"value":"65K10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4026720$2E0C8665-FBE2-4762-9207-71758439152A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"825824b72358cea3f4c538ac811267e114a8e2b4","datavalue":{"value":"49M25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4026720$BFC45D67-FF95-40CF-8C4C-AA9D17859D37","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"012e86f9177c24e37dcdc94857f238df2620f196","datavalue":{"value":"49M37","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4026720$48FA0E84-7DB0-498C-9893-F606606896E9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"8dce91b45aae56da74aca9c1ed1bc5361b215565","datavalue":{"value":"92D25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4026720$8551342D-C172-4FE8-80BB-56B0CEBAD802","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"46f6f97ad6bf74faa2be6629aac320ad56ec94a7","datavalue":{"value":"49J15","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4026720$DDB99A94-3911-4B76-B9DB-CED988808198","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"baf0fd3f37d63b9fa7184c813cb091b8f72cfe9f","datavalue":{"value":"125077","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4026720$2016F134-21E4-49F7-B90E-647B6A0083E1","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"9aa819d3f441267da5bcc23e064ff190f345afc4","datavalue":{"value":"state space constraints","type":"string"},"datatype":"string"},"type":"statement","id":"Q4026720$E25DADE1-3668-43C1-B869-A8EA99886D53","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f47fee90c5592664decba5aa2e51ae852ecd7730","datavalue":{"value":"optimal control","type":"string"},"datatype":"string"},"type":"statement","id":"Q4026720$44D613AC-5D87-4BB6-97A2-3896C706ABDB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e992d1277c1a271802666efbb76bb90d62381bf5","datavalue":{"value":"mathematical programming algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q4026720$7DD75916-7388-4782-B72A-D5482736F0B8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"c356f31e179f287b3d8cad49b5096288a6663152","datavalue":{"value":"optimal harvesting problem","type":"string"},"datatype":"string"},"type":"statement","id":"Q4026720$B57A0CAD-9321-4508-B27A-36341499FAD2","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":"Q4026720$762F0E22-ABD1-425D-9382-6D165139A632","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"16866438ab429c927e66fc2cad0ccf711d7ca1ea","datavalue":{"value":{"entity-type":"item","numeric-id":2940339,"id":"Q2940339"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"1242a5ec8330c43c077ae483fc6b4c3bb45129c0","datavalue":{"value":{"amount":"+0.8089994192123413","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":"Q4026720$F17DEDCF-0024-498B-BA48-4CE535ECA821","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"f79449455e732b9ebfdd35e3c9a3269c5163539c","datavalue":{"value":{"entity-type":"item","numeric-id":5395222,"id":"Q5395222"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"62e64ab85c4a4a8cc9106a8ea2b79470c9d56d5f","datavalue":{"value":{"amount":"+0.7991307973861694","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":"Q4026720$9178E22E-455E-473E-81C7-1650A176C11B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"1d4fdfbb6f18e7a480c96d7f0dbe87f6de8d23d1","datavalue":{"value":{"entity-type":"item","numeric-id":2488079,"id":"Q2488079"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"a966e85de63c3209f6baac740a781c0944f6b6eb","datavalue":{"value":{"amount":"+0.7851824164390564","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":"Q4026720$DD1F1303-67FA-4A68-B296-AB4BB35205A8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"e2881367442d6431fe94a26d92fff3f5ec94c01f","datavalue":{"value":{"entity-type":"item","numeric-id":1303241,"id":"Q1303241"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"6b093780e391eb2fd8c148aecf36bc630c734134","datavalue":{"value":{"amount":"+0.7819994688034058","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":"Q4026720$3B5E17C3-15F4-493D-84FC-EA7427C02C9E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"99cde530d4832e49a59eda3ae2267ddc9cc074b8","datavalue":{"value":{"entity-type":"item","numeric-id":3779327,"id":"Q3779327"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"6b093780e391eb2fd8c148aecf36bc630c734134","datavalue":{"value":{"amount":"+0.7819994688034058","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":"Q4026720$1E4C0C18-3F8E-4928-8D6E-BE31B4AF3567","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"3bd1da5ec54b19f2649783bf1d8f50852ffae2ae","datavalue":{"value":{"text":"A numerical algorithm for constraint optimal control problems with applications to harvesting. (With comments)","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q4026720$A150D937-5E75-4292-A9FD-9E107D06D06F","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"74470f5043a5b26d1f63b5c1d31d5baed667c63e","datavalue":{"value":"[For the entire collection see Zbl 0745.00064.] A numerical method of solving optimal control problems for ordinary differential equations subject to control and state constraints is reported. The method is a minor modification of that proposed and implemented by \\textit{C. J. Goh} and \\textit{K. L. Teo} [Automatica 24, 3-18 (1988; Zbl 0637.49017)]. In the method, the original inequality-type state constraints are substituted by non-smooth equality-type constraints, which in turn are approximated by smooth functions. Later on the problem is discretized in time and solved numerically using standard mathematical programming algorithms. No proofs of convergence are provided. The method is applied to a comprehensive numerical study of an optimal harvesting problem for a fishery menagement system.","type":"string"},"datatype":"string"},"type":"statement","id":"Q4026720$DBBDAB31-B5EF-41B0-86DC-099CCB81C1D5","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A numerical algorithm for constraint optimal control problems with applications to harvesting. (With comments)","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_numerical_algorithm_for_constraint_optimal_control_problems_with_applications_to_harvesting._(With_comments)"}}}}}