FINDING INTEGER EFFICIENT SOLUTIONS FOR BICRITERIA AND TRICRITERIA NETWORK FLOW PROBLEMS USING DINAS

Authors
MUSTAFA A GOH M
Citation
A. Mustafa et M. Goh, FINDING INTEGER EFFICIENT SOLUTIONS FOR BICRITERIA AND TRICRITERIA NETWORK FLOW PROBLEMS USING DINAS, Computers & operations research, 25(2), 1998, pp. 139-157
Citations number
21
Categorie Soggetti
Operatione Research & Management Science","Operatione Research & Management Science","Computer Science Interdisciplinary Applications","Engineering, Industrial
Journal title
Computers & operations research → ACNP
ISSN journal
03050548
Volume
25
Issue
2
Year of publication
1998
Pages
139 - 157
Database
ISI
SICI code
0305-0548(1998)25:2<139:FIESFB>2.0.ZU;2-4
Abstract
This article describes a method for adjusting into integral form the n oninteger compromise solutions obtained via DINAS to interactively sol ve the bicriteria and tricriteria network flow problems. Utilizing the special properties of network flows, particularly the formation of a unique cycle associated with moving from an extreme point solution to its adjacent extreme point solution, the method only requires the obse rvation and manipulation of the decision variable values of the compro mise solutions. (C) 1998 Elsevier Science Ltd. All rights reserved.