|Budget Amount *help
¥2,100,000 (Direct Cost : ¥2,100,000)
Fiscal Year 1996 : ¥400,000 (Direct Cost : ¥400,000)
Fiscal Year 1995 : ¥400,000 (Direct Cost : ¥400,000)
Fiscal Year 1994 : ¥1,300,000 (Direct Cost : ¥1,300,000)
According to the sets and functions defining the problem mathematical programming problems are classified roughly into two groups : convex program and nonconvex program. Convex programs have been attracting many researchers, theoretically well established, and practical codes are offered to solve large scale problems. Nonconve programs, however, are in unsatisfactory situation because of its difficulty.
We set the nonconvex problem on the differece of several convex sets as a standard problem of nonconvex programs and developed algorithms for finding a globally optimal solution. The largest empty sphere problem, the out-of-roundess problem in higher dimension are cast into this standard problem. We proposed an algorithm for the problem which yileds a globally optimal solution within a finite number of iterations, which forms a striking contrast to the existing algorithms proposed by Kuno-Konno-Yamamoto, Kuno-Yajima-Yamamoto-Konno, Thach-Burkard-Oettli, Pferschy-Tuy for the problem which yield only an approximate solution. As far as we know, the algorithm is the first one which enjoys both the global optimality and the finiteness. We compared the algorithm with the existing algorithms by computational experiment, which supports the superiority of our algorithm.
We also formulated the out-of-roundess problem as a fractional problem and proposed an algorithm. For the variational inequality problem we developed a continuous deformation algorithm based on the simplcial algorithm.
Furthermore, we have finished a book on the traveling salesman problem, which has been known as one of the hardest problems, with the aim of introducing the difficulty and interest of the problem.