Global Optimization Method for Solving Mathematical Programs with Linear Complementarity Constraints

We propose a method for finding a global optimal solution of programs with linear complementarity constraints. This problem arises for instance in bilevel programming. 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...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of optimization theory and applications Vol. 124; no. 2; pp. 467 - 490
Main Authors:	Thoai, N. V., Yamamoto, Y., Yoshise, A.
Format:	Journal Article
Language:	English
Published:	New York, NY Springer 01.02.2005 Springer Nature B.V
Subjects:	Algorithms Applied sciences Exact sciences and technology Mathematical programming Operational research and scientific management Operational research. Management science Optimization Polytopes equilibrium constraints Branch and bound method Optimization method Global optimum Linear programming Bilevel programming Programs with linear complementarity constraints Numerical method Complementarity problem Equilibrium condition Global solution global optimization Optimal solution Mathematical programming
ISSN:	0022-3239, 1573-2878
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!