| 一类（0，1）规划问题的定界组合算法及其在离散变量结构优化设计中的应用 |
| |
| 引用本文： | 柴山.一类（0，1）规划问题的定界组合算法及其在离散变量结构优化设计中的应用[J].工程力学,1995,12(1):81-91. |
| |
| 作者姓名： | 柴山 |
| |
| 作者单位： | 山东工程学院 |
| |
| 摘 要： | 本文提出了求解一类线性（０，１）规划问题的定界组合算法。本算法首先根据约束条件对组合的下界进行定界，在搜索过程中再根据目标函数对其上界进行定界，因而在搜索过程中删除了大量的非可行组合及非最优组合，大大地减少了计算工作量，提高了计算效率。
|
| 关 键 词： | 整数规划，（0，1）规划，离散变量，结构优化设计 |
A DELIMITATIVE AND COMBINATORIAL ALGORITHM FOR A KIND OF (0,1) PROGRAMMING AND ITS APPLICATION IN OPTIMUM DESIGN OF STRUCTURES WITH DISCRETE VARIABLES |
| |
| Chai Shan.A DELIMITATIVE AND COMBINATORIAL ALGORITHM FOR A KIND OF (0,1) PROGRAMMING AND ITS APPLICATION IN OPTIMUM DESIGN OF STRUCTURES WITH DISCRETE VARIABLES[J].Engineering Mechanics,1995,12(1):81-91. |
| |
| Authors: | Chai Shan |
| |
| Affiliation: | Shandong Institute of Engineering |
| |
| Abstract: | A delimitative and combinatorial algorithm for a kind of (0,1) programming is advanced in this paper. The algorithm proposed here defines the lower bound according to the constraint conditions, and then the upper bound in accordance to the objective function, with a lot of unfeasible or non-optimum combinations being eliminated in searching process, computational effort being decreased, and effectiveness being increased significantly. |
| |
| Keywords: | integer programming (0 1) programming discrete variable optimum design of structure |
| 本文献已被 CNKI 维普 等数据库收录！ |
