| Evolutionary Programming for IP/MIP Problems with Linear Constraints |
| |
| 作者姓名： | Red Qingsheng |
| |
| 作者单位： | Red Qingsheng (Dept. of Computer Science and Engineering，Shanghai Jiaotong University，200030，P. R. China) Zeng Jin (Dept. of Applied Mathematics，Shanghai Jiaotong University，200030，P. R. China) Qi Feihu (Dept. of Computer Science and Engineering，Sh |
| |
| 基金项目： | This project was supported by the National Natural Science Foundation of China. |
| |
| 摘 要： | 1. INTSODUCTIONThe common illteger programming (lP) is a mathematical model which is designed to find aset of non-negative variables to medmize (or minimize) a nonlinear objective function whilesatisfying a set of constraints under integer restrictions of variables. An lP model with somevariables reqllired to be real is a mixed integer programming (MIP).The history of solving lP/MIP problems is not very old. According to reference 1], ageneral method for solvillg such problems may not…
|
Evolutionary Programming for IP/MIP Problems with Linear Constraints |
| |
| Red Qingsheng.Evolutionary Programming for IP/MIP Problems with Linear Constraints[J].Journal of Systems Engineering and Electronics,2000,11(3). |
| |
| Authors: | Ren Qingsheng ZENG Jin Qi Feihu |
| |
| Abstract: | In this paper, we propose a modified evolutionary programming with dynamic domain for solving nonlinear IP/MIP problems with linear constraints, without involving penalty function or any transformation for the problem to a linear model or others. The numerical results show that the new algorithm gives a satisfactory performance in which it works of high speed and accuracy in IP/MIP problems. |
| |
| Keywords: | Evolutionary programming Mixed integer programming Dynamic domain |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
