On minimum expected search time for a multiplicative random search problem

Mohamed Abd Allah El-Hadidy and Mohamed Abd El-Hady Kassem

International Journal of Operational Research, 2017, vol. 29, issue 2, 219-247

Abstract: In this paper, we obtain the minimum expected search time for a multiplicative random search problem from a viewpoint of computational optimisation. The target is drifting in one of m-disjoint bounded regions. Each region has a one searcher. We get a probabilistic multi-objective nonlinear fractional programming problem and we focus on a new method for solving it to obtain the minimum expected search time for detecting the target. An illustrative example has been given to demonstrate the applicability of this method.

Keywords: optimal search theory; multi-objective nonlinear fractional programming problem; duality; saddle point; Lagrange function. (search for similar items in EconPapers)
Date: 2017
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=83957 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:29:y:2017:i:2:p:219-247

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().