摘要
本文提出了求解一类线性（０，１）规划问题的定界组合算法。本算法首先根据约束条件对组合的下界进行定界，在搜索过程中再根据目标函数对其上界进行定界，因而在搜索过程中删除了大量的非可行组合及非最优组合，大大地减少了计算工作量，提高了计算效率。
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.
出处
《工程力学》
EI
CSCD
1995年第1期81-91,共11页
Engineering Mechanics
基金
山东省自然科学基金
关键词
线性规划
离散变量
工程结构
最优设计
integer programming, (0,1) programming, discrete variable, optimum design of structure
