CONSTRUCTING THE MINIMIZATION DIAGRAM OF A 2-PARAMETER PROBLEM

被引：8

作者：

FERNANDEZBACA, D ^{[1
]}

SRINIVASAN, S ^{[1
]}

机构：

[1] IBM CORP,ROCHESTER,MN 55901

来源：

OPERATIONS RESEARCH LETTERS | 1991年 / 10卷 / 02期

关键词：

PARAMETRIC PROGRAMMING; SENSITIVITY ANALYSIS; COMBINATORIAL COMPUTING; ALGORITHM ANALYSIS; PROGRAM MODULE ALLOCATION;

D O I：

10.1016/0167-6377(91)90092-4

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

Let P(lambda, mu) = min {f1(x) + lambda-f2(x) + mu-f3(x)\x is-an-element-of D}. We present a method that constructs P(lambda, mu) for all lambda, mu in a given interval in O(f.T(n) + f2) time, where f denotes the number of faces of P(lambda, mu) in the interval and T(n) denotes the time needed to solve the associated nonparametric problem.

引用

页码：87 / 93

页数：7

共 15 条

[1]

Bokhari SH., 1987, ASSIGNMENT PROBLEMS

[2] COMPLEXITY OF SOME PARAMETRIC INTEGER AND NETWORK PROGRAMMING-PROBLEMS [J].