“…The MINLP method has a general problem statement of: min f{x,y) (2.4) x,y subject to: h{x,y) =0 (2.5) gix.y) >0 (2.6) yeY (2.7) where x, h, and g have the same dimension as the NLP problem and where y is a pvector within Y which is a set of integer variables. It's important to note that when finite bounds exist on the integer variables y, yL<y<yu (2.8) the integer variables can be expressed as binary, i.e., 0-1 variables, denoted by 2,-, by the following formula: y = J/L + + 2^2 + 4^3 + ... + 2'^^ (2)(3)(4)(5)(6)(7)(8)(9) where N is the minimum number of binary variables needed, and is given by N = l + INT log(yu -yt) log 2 (2.10) where INT indicates the integer tnmcation of the term in the brackets. This expression correspondence may not be practical for very large boimds, but the binary form of the integer variables is particxilarly applicable to this work which is described in Chapter 4.…”