The server is under maintenance between 08:00 to 12:00 (GMT+08:00), and please visit later.
We apologize for any inconvenience caused
Login  | Sign Up  |  Oriprobe Inc. Feed
China/Asia On Demand
Journal Articles
Laws/Policies/Regulations
Companies/Products
Bookmark and Share
Optimization Methods for a Class of Integer Polynomial Programming Problems
Author(s): 
Pages: 23-35
Year: Issue:  4
Journal: Operations Research Transactions

Keyword:  polynomial integer programming problemlocal optimization methodglobal optimization method;
Abstract: 考虑一类特殊的多项式整数规划问题.此类问题有很广泛的实际应用,并且是NP难问题.对于这类问题,最优性必要条件和最优性充分条件已经给出,利用这些最优性条件设计最优化算法.首先,利用最优性必要条件,给出一种新的局部优化算法.进而结合最优性充分条件、新的局部优化算法和辅助函数,设计新的全局最优化算法.给出的算例展示算法是有效的和可靠的.
Related Articles
No related articles found