.png){kind=icon}
.png){kind=icon}
Return
An algorithm for a selection procedure
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(99)00409-9.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
selection problem
qualitative programming problem
optimal choice
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available