No abstract

Some researchers have presented the application of radial basis function approximation to the evaluation of option contracts.In a previous study, the authors described the evaluation of Asian options by using radial basis function approximation. The numerical results indicated that the computational accuracy depended on the radial basis function and the reciprocal multi-quadric function was better than the multi-quadric one.So, in this study, some radial basis functions are applied to the evaluation of the Asian option of one asset. We compare the multi-quadric, the reciprocal multiquadric, and Gaussian functions. The results show that the reciprocal multiquadric function and Gaussian function give better numerical results and the reciprocal multi-quadric function is better than the others.

This paper considers the combination of the general sum-of-processing-time effect and position-dependent effect on a single machine. The actual processing time of a job is defined by functions of the sum of the normal processing times of the jobs processed and its position and control parameter in the sequence. We consider two monotonic effect functions: the nondecreasing function and the nonincreasing function. Our focus is the following objective functions, including the makespan, the sum of the completion time, the sum of the weighted completion time, and the maximum lateness. For the nonincreasing effect function, polynomial algorithm is presented for the makespan problem and the sum of completion time problem, respectively. The latter two objective functions can also be solved in polynomial time if the weight or due date and the normal processing time satisfy some agreeable relations. For the nondecreasing effect function, assume that the given parameter is zero. We also show that the makespan problem can remain polynomially solvable. For the sum of the total completion time problem and a 1 is the deteriorating rate of the jobs, there exists an optimal solution for a 1 ≥ M ; a V-shaped property with respect to the normal processing times is obtained for 0 < a 1 ≤ 1 . Finally, we show that the sum of the weighted completion problem and the maximum lateness problem have polynomial-time solutions for a 1 > M under some agreeable conditions, respectively.