An algorithm for a selection procedure

被引:0
|
作者
Maleki, HR [1 ]
机构
[1] Kerman Univ, Dept Math, Kerman, Iran
关键词
selection problem; qualitative programming problem; optimal choice;
D O I
10.1016/S0377-2217(99)00409-9
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
When we have a selection problem that involves qualitative information, we can use the qualitative programming method and find the optimal choice by using integer programming. However, in practice after formulation of the problem we have a large scale model. In this note we introduce a very effective method for solving a qualitative programming problem. The only operations used in this method are scalar and matrix addition, and hence for problems of reasonable size, the method does not need high speed computers, and can be supplemented using hand calculators. (C) 2001 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:674 / 678
页数:5
相关论文
共 50 条