An all integer method for integer convex programs
作者:
Suresh Chandra,
M. Chandramohan,
期刊:
Mathematische Operationsforschung und Statistik. Series Optimization
(Taylor Available online 1980)
卷期:
Volume 11,
issue 1
页码: 85-93
ISSN:0323-3898
年代: 1980
DOI:10.1080/02331938008842635
出版商: Akademic-Verlag
数据来源: Taylor
摘要:
A finite all integer method is proposed for solving a class of integer convex programming problems in which the problem functions are convex polynomials with rational coefficients. A small numerical example is also given to illustrate the algorithm.
点击下载:
PDF (300KB)
返 回