AN APPROXIMATE ALGORITHM FOR DISCRETE LINEAR PROGRAMMING

被引：2

作者：

BIONDI, E

SCHMID, R

机构：

[1] Istituto di Elettrotecnica ed Elettronica, Politecnico di Milano, Milan

来源：

IEEE TRANSACTIONS ON SYSTEMS SCIENCE AND CYBERNETICS | 1969年 / SSC5卷 / 01期

关键词：

D O I：

10.1109/TSSC.1969.300246

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

An algorithm is presented for determining an approximate solution of a large class of discrete linear programming problems, and an upper bound on the profit loss due to the approximation is computed. A subregion of the original polyhedron of feasible solutions is also defined; such a subregion certainly contains the optimal solution of the discrete linear programming problem considered. A geometrical interpretation of the algorithm is given. Copyright © 1969 by The Institute of Electrical and Electronics Engineers, Inc.

引用

页码：65 / &