haku: @indexterm Operational research problems / yhteensä: 23
viite: 15 / 23
| Tekijä: | Li, H. |
| Otsikko: | Global optimization for mixed 0-1 programs with convex or separable continuous functions |
| Lehti: | Journal of the Operational Research Society
1994 : SEP, VOL. 45:9, p. 1068-1076 |
| Asiasana: | RESEARCH SOFTWARE OPERATIONAL RESEARCH PROBLEMS |
| Kieli: | eng |
| Tiivistelmä: | This paper proposes a global approach for solving mixed 0-1 programming problems containing convex or separable continuous functions. Given a mixed 0-1 polynomial term "z" equals "x1x2.......xng (Y)" where x1, x2...., xn are 0-1 integer variables and g (Y) is a convex or a separable continuous function it is possible to transform "z" into a set of inequalities where x1, x2.......,xn and g (Y) are separated from each other. Bound-and-bound method is discussed. |
SCIMA