On duality of fuzzy multiobjective optimisation problems: application to a multiplicative search technique

In this paper, we present a new study to minimise the expected value of the first meeting time between one of the searchers and the randomly moving target in the space (case of the multiplicative search technique) from a viewpoint of computational optimisation. We introduce the dual problem for the fuzzy multiobjective nonlinear programming problem (FMONLP) with inequality constraints which is obtained in El-Hadidy [International Journal of Computational Methods, Vol. 13, No. 6 (2016) 1650038 (38 pages)]. For this problem, we generalise the following classes of the vector-valued functions for fuzzy sets: weak strictly pseudo-quasi type I, strong pseudo-quasi type I, weak quasi strictly type I and weak strictly pseudo type I. We provide the fuzzy forms of Mond-Weir and general Mond-Weir duals for the involved problem and consequently various duality results are derived.