Solution of the Retiring Search Problem

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5150

Full metadata record

DC Field	Value	Language
dc.creator	Morse, Philip M., 1903-	-
dc.date	2004-05-28T19:25:24Z	-
dc.date	2004-05-28T19:25:24Z	-
dc.date	1977-12	-
dc.date.accessioned	2013-10-09T02:38:00Z	-
dc.date.available	2013-10-09T02:38:00Z	-
dc.date.issued	2013-10-09	-
dc.identifier	http://hdl.handle.net/1721.1/5150	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	The well-known variational principle of the optimal distribution of search effort is applied to the case where the sought-for target has been located momentarily but the search cannot begin until a time T o later, during which interval the target may or may not move. The optimal search path, called the retiring search curve,, is a spiral starting at the point of original location, with the relationship between r and or L, the length of path, given by a differential equation derived from the variational principle. This equation is solved for a range of values of the parameters of greatest practical interest. The results are tabulated and also displayed in graphical form for use in practice. General conclusions emerge, of considerable practical value in searches of this kind.	-
dc.format	1746 bytes	-
dc.format	2688231 bytes	-
dc.format	application/pdf	-
dc.language	en_US	-
dc.publisher	Massachusetts Institute of Technology, Operations Research Center	-
dc.relation	Operations Research Center Working Paper;OR 070-77	-
dc.title	Solution of the Retiring Search Problem	-
dc.type	Working Paper	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI