欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
利用对数函数的性质将一类多乘积规划问题等价地转化为一个凹最小问题。针对这个问题的凹和特殊结构，利用单纯形上凹函数凸包络的线性性质，给出线性规划松弛问题以确定原问题最优值的下界，由此提出一类多乘积规划问题的单纯形分支定界算法，并且给出收敛性证明。数值例子表明所提出的算法是可行的和有效的。
英文摘要：
A class of multi-product programming problems is equivalently converted into a concave minimum prob- lem by using the properties of logarithmic function. For the concave-sum special structures and with that property that the convex envelope of concave function is linear on simplex, a linear programming relaxation problem is given to determine the lower bound of the global optimal value of the original problem. Thereby, a simplex branch and bound method for solving a class of multi-product problems is proposed and the convergence proof of the proposed method is given. Numerical examples show that the proposed method is feasible and effective.
同期刊论文项目
同项目期刊论文
Modified Multi-Objective Particle Swarm Optimization Algorithm for Multi-objective Optimization Prob
Modified differential evolution algorithm of constrained nonlinear mixed integer programming problem
PSO algorithm with chaos and gene density mutation for solving nonlinear zero-one integer programmin
期刊信息
位置：