INEXACT LINEAR-PROGRAMMING WITH GENERALIZED RESOURCE SETS

被引：42

作者：

SOYSTER, AL

机构：

[1] Virginia Polytechnic Institute, State University, Blacksburg

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1979年 / 3卷 / 04期

关键词：

D O I：

10.1016/0377-2217(79)90227-3

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

Inexact linear programs are considered in which the form of the resource set is generalized. Two cases are considered. In the first case closed form solution methods are provided when the resource set as polyhedral. For the general convex resource set no finite representation is apparently possible, although the rudiments of an iterative, approximation algorithm are given along with some illustrations in a numerical example. © 1979.

引用

页码：316 / 321

页数：6