凸整数规划最优点的判定条件  

A SUFFICIENT CONDITION FOR THE OPTIMAL SOLUTION OF CONVEX INTEGER PROGRAMMING

作　　者：刘晓华[1] 

机构地区：[1]湖南大学,长沙410079

出　　处：《经济数学》2000年第4期70-72,共3页Journal of Quantitative Economics

摘　　要：本文得到判别已知可行整值点为凸整数规划最优解的一个充分条件 ,此条件只涉及目标函数在该整值点为中心的边长为 2的超立方体上的性态 .One has obtained a sufficient condition with which one can deduce whether one feasible solution x * of convex integer programming is optimal.This condction is only involved with the behaviour of the objective function in the cube which the center is x * and the lengths of the edges are two.

关 键 词：整数规划 最优解 充分条件 目标函数 凸规划 

分 类 号：O221.4[理学—运筹学与控制论]