Summeya Munawar, Muhammad Awais Ghani, Basharat Ali, Azam, Zahid Rashid, Romana Anjum, Sarwar, Tanveer Ahmad, Anam Noor, Qumer Iqbal, Kaiser Latif Cheema, Muzammil Jahangir, Jahanzeb Mehran Abbas

Lower searching cost and access to large amounts of information on the Internet are making a consumer’s search more iterative. Through a synthesis of literature from consumer behaviour and information science, we propose a process model of online consumer search in which a consumer may move forward in the process towards a final product selection, but also is likely to backtrack to an earlier s...

We present an improved version of a full Nesterov-Todd step infeasible interior-point method for linear complementarityproblem over symmetric cone (Bull. Iranian Math. Soc., 40(3), 541-564, (2014)). In the earlier version, each iteration consisted of one so-called feasibility step and a few -at most three - centering steps. Here, each iteration consists of only a feasibility step. Thus, the new...

In the present paper, we show that $S^*$ iteration method can be used to approximate fixed point of almost contraction mappings. Furthermore, we prove that this iteration method is equivalent to CR iteration method  and it produces a slow convergence rate compared to the CR iteration method for the class of almost contraction mappings. We also present table and graphic to support this result. F...

Value iteration is a commonly used and em­ pirically competitive method in solving many Markov decision process problems. However, it is known that value iteration has only pseudo­ polynomial complexity in general. We estab­ lish a somewhat surprising polynomial bound for value iteration on deterministic Markov decision (DMDP) problems. We show that the basic value iteration procedure converges...

Value iteration is a commonly used and empirically competitive method in solving many Markov decision process problems. However, it is known that value iteration has only pseudopolynomial complexity in general. We establish a somewhat surprising polynomial bound for value iteration on deterministic Markov decision (DMDP) problems. We show that the basic value iteration procedure converges to th...

In this paper, we have proposed a new iterative method for finding the solution of ordinary differential equations of the first order. In this method we have extended the idea of variational iteration method by changing the general Lagrange multiplier which is defined in the context of the variational iteration method.This causes the convergent rate of the method increased compared with the var...