摘要
对一有界约束非线性混合整数规划问题进行了研究。通过对该问题性质的分析，把它变成了一个等价的、易求解的纯整数规划问题，并给出了原问题相应的算法。
The problem of bounded nonlinear mixed integer programming is studied. Thenonlinear problem is trans formed into an equivalent pure integer problem which can be solvedeasily. The algorithm for calculating the prime problem is constructed.
出处
《中国农业大学学报》
CAS
CSCD
北大核心
1998年第2期16-18,共3页
Journal of China Agricultural University
关键词
非线性整数规划
规划
有界约束
最优解
nonlinear integer programming
bounded constraint
optimal solution
