.png){kind=icon}
Return
AN INTERACTIVE PROCEDURE FOR MULTIPLE-OBJECTIVE INTEGER LINEAR-PROGRAMMING PROBLEMS
.png){kind=icon}
PRE
AI
DOI：10.1016/0377-2217(93)90190-X.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
There are many practical problems where the objective functions and the constraints can be represented by linear functions but the decision variables are restricted to only integer values. Our objective is to present an interactive procedure for the multiple objective integer linear programming problem that is fast, does not place too many demands on the decision maker and can be implemented without requiring any special software. We illustrate the proposed procedure with a numerical example and report some computational experience.
Keywords:
ALGORITHM
CHEBYSHEV NORM
INTEGER PROGRAMMING
MULTIPLE CRITERIA
MULTIPLE OBJECTIVES
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
Cited Papers
ShareSave
A CLASS OF PRACTICAL INTERACTIVE BRANCH AND BOUND ALGORITHMS FOR MULTICRITERIA INTEGER PROGRAMMING
PREAI
ShareSaveShareSaveGeochemical and mineralogical investigation of the Permian–Triassic boundary in the continental realm of the southern Karoo Basin, South Africa.png)
Palaeoworld
PalaeoworldIF0
PREAI
ShareSave
View more