An algorithm for global optimization of a class of nonconvex MINLP problems is devel-oped and presented in this paper.By partitioning the variables,dual representation of the primal ofsubproblems and outer-approximati...An algorithm for global optimization of a class of nonconvex MINLP problems is devel-oped and presented in this paper.By partitioning the variables,dual representation of the primal ofsubproblems and outer-approximation strategy are used to develop a representative relaxed iterativeproblem.Then the original MINLP problem is replaced by a series of subproblems and relaxediterative problems.By exploiting the particular form of the nonconvex MINLP problem,the feasibleregion of this problem is explicitly included in the representative problem,thus the inconvenienceencountered with the GBD method can be avoided.The proposed method is illustrated andinterpreted geometrically with an example problem.展开更多
基金Supported by the National Natural Science Foundation of China
文摘An algorithm for global optimization of a class of nonconvex MINLP problems is devel-oped and presented in this paper.By partitioning the variables,dual representation of the primal ofsubproblems and outer-approximation strategy are used to develop a representative relaxed iterativeproblem.Then the original MINLP problem is replaced by a series of subproblems and relaxediterative problems.By exploiting the particular form of the nonconvex MINLP problem,the feasibleregion of this problem is explicitly included in the representative problem,thus the inconvenienceencountered with the GBD method can be avoided.The proposed method is illustrated andinterpreted geometrically with an example problem.