Author's: Xiangyang Li, Menglong Su and Leshun Xu
Pages: [307] - [312]
Received Date: May 20, 2010
Submitted by:
In this paper, we propose a CHIP method for linear discrete optimization problems. Under conditions commonly used in the literature, a smooth path will be proven to exist. This will give a constructive proof of existence of solution and lead to an implementable globally convergent algorithm.
CHIP method, linear discrete optimization problems, globally convergent algorithm.