A FINITE ALGORITHM FOR SOLVING THE GENERALIZED LATTICE POINT PROBLEM

作     者：FULOP, J 

作者机构：HUNGARIAN ACAD SCIINST COMP & AUTOMATDEPT OPERAT RESKENDE U 13-17H-1518 BUDAPESTHUNGARY 

出 版 物：《EUROPEAN JOURNAL OF OPERATIONAL RESEARCH》 (欧洲运筹学杂志)

年 卷 期：1991年第51卷第2期

页      面：270-281页

核心收录：

学科分类：1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 070104[理学-应用数学] 0701[理学-数学] 

主　　题：MATHEMATICAL PROGRAMMING NONCONVEX PROGRAMMING CUTTING PLANE METHODS 

摘      要：We deal with the nonconvex program called Generalized Lattice Point Problem. Here, a linear function is to be minimized over such points of a polyhedron which belong to the at most q-dimensional faces of another polyhedron. We present a finite cutting plane algorithm for solving the considered problem. Computational experience is also provided.