Algorithms for nonlinear integer bicriterion problems
Algorithms for nonlinear integer bicriterion problems
复制标题
非线性整数双准则问题的算法
DOI：
10.1007/bf00939577
复制
发表时间：
1989
影响因子：
1.9
通讯作者：
H. Moskowitz
中科院分区：
文献类型：
--
作者：
P. Eswaran;A. Ravindran;H. Moskowitz
提出了两种求解非线性双准则整数数学规划（BIMP）问题的算法。第一个是生成整个有效集的非交互式过程，第二个是确定决策者 (DM) 的最佳折衷解决方案的交互式过程。 Tchebycheff 范数相关方法用于生成 BIMP 问题的有效点。还介绍了交互式过程在质量控制问题中的应用。
Two algorithms to solve the nonlinear bicriterion integer mathematical programming (BIMP) problem are presented. One is a noninteractive procedure that generates the entire efficient set, and the second one is an interactive procedure that determines the best compromise solution of the decision maker (DM). A Tchebycheff norm related approach is used for generating the efficient points for the BIMP problem. An application of the interactive procedure for a quality control problem is also presented.