返回
MINIMAX RESOURCE-ALLOCATION PROBLEMS - OPTIMIZATION AND PARAMETRIC ANALYSIS
DOI:10.1016/0377-2217(92)90335-7.png)
摘要
En 中文
We consider a linear minimax resource allocation problem with single-variable terms in the objective function and multiple knapsack-type resource constraints. All variables are continuous and nonnegative. Efficient algorithms for such large-scale problems have been developed by Luss and Smith and by Tang. This paper describes an enhanced algorithm that provides a more efficient search for the optimal solution. Further, we develop post-optimization schemes and parametric analysis that are employed once an optimal solution for the original minimax problem is obtained. Post-optimization provides a perturbed optimal solution under a specified change in the data, whereas parametric analysis provides a continuum of optimal solutions when some data elements are changed over a given interval.
Keyword:
LINEAR PROGRAMMING
LARGE-SCALE OPTIMIZATION
RESOURCE ALLOCATION
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
Identification of a major QTL for resistance to Cercospora leaf spot disease in cowpea (Vigna unguiculata (L.) Walp.) revealed common genomic region with that for the resistance to angular leaf spot in common bean (Phaseolus vulgaris L.)
Euphytica
IF0
An Integrated Framework for Efficient Transport of Real-Time MPEG Video over ATM Best Effort Service

