In this thesis, we develop constrained simulated annealing (CSA), a global optimization algorithm that asymptotically converges to constrained global minima with probability one, for solving discrete constrained nonlinear programming problems-In this thesis, we develop constrained simulated annealing (CSA), a global optimization algorithm that asymptotically converges to constrained global minima　with probability one, for solving discrete constrained nonlinear programming problems