2021-07-24T21:43:33Zhttps://tsukuba.repo.nii.ac.jp/oaioai:tsukuba.repo.nii.ac.jp:000226832021-03-01T19:43:24ZGlobal optimization method for solving mathematical programs with linear complementarity constraints山本, 芳嗣吉瀬, 章子Thoai, N. V.Yamamoto, YoshitsuguYoshise, AkikoWe propose a method for finding a global optimal solution of programs with linear complementarity constraints. The program arises for instance from the bilevel programs. The main idea of the method is to generate a sequence of points either ending at a global optimal solution within a finite number of iterations or converging to a global optimal solution. The\nconstruction of such a sequence is based on the techniques such as branch and bound technique,\nwhich are used successfully in global optimization. Some results on a numerical test of the algorithm are reported.Includes bibliographical references2002jpntechnical reporthttp://hdl.handle.net/2241/704https://tsukuba.repo.nii.ac.jp/records/22683Institute of Policy and Planning Sciences discussion paper series ~ no. 987https://tsukuba.repo.nii.ac.jp/record/22683/files/1.pdfapplication/pdf178.0 kB2013-12-25