Linear programming with variable matrix entries

被引:9
作者
Serafini, P [1 ]
机构
[1] Univ Udine, Dipartimento Matemat & Informat, I-33100 Udine, Italy
关键词
linear programming; integer linear programming; variable data;
D O I
10.1016/j.orl.2004.04.011
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
We consider linear programming (continuous or integer) where some matrix entries are decision parameters. If the variables are nonnegative the problem can be easily solved in two phases. It is shown that direct costs on the matrix entries make the problem NP-hard. Finally, a strong duality result is provided. (C) 2004 Elsevier B.V. All rights reserved.
引用
收藏
页码:165 / 170
页数:6
相关论文
共 8 条
[1]  
[Anonymous], COMPUTING S6
[2]   AN O(N) ALGORITHM FOR QUADRATIC KNAPSACK-PROBLEMS [J].
BRUCKER, P .
OPERATIONS RESEARCH LETTERS, 1984, 3 (03) :163-166
[3]  
Hansen Eldon R., 1992, Global optimization using interval analysis
[4]  
JANSSON C, 1993, STUD COMPUT MATH, V5, P381
[5]   Interval methods and fuzzy optimization [J].
Lodwick, WA ;
Jamison, KD .
INTERNATIONAL JOURNAL OF UNCERTAINTY FUZZINESS AND KNOWLEDGE-BASED SYSTEMS, 1997, 5 (03) :239-249
[6]   AN ALGORITHM FOR A SINGLY CONSTRAINED CLASS OF QUADRATIC PROGRAMS SUBJECT TO UPPER AND LOWER BOUNDS [J].
PARDALOS, PM ;
KOVOOR, N .
MATHEMATICAL PROGRAMMING, 1990, 46 (03) :321-328
[7]  
Rokne JG, 2001, STUD FUZZ SOFT COMP, V70, P1
[8]   SCHEDULING OF POWER-GENERATION VIA LARGE-SCALE NONLINEAR OPTIMIZATION [J].
VANDENBOSCH, PPJ ;
LOOTSMA, FA .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1987, 55 (02) :313-326