Finding integer efficient solutions for bicriteria and tricriteria network flow problems using DINAS

Finding integer efficient solutions for bicriteria and tricriteria network flow problems using DINAS

0.00 Avg rating0 Votes
Article ID: iaor1999360
Country: United Kingdom
Volume: 25
Issue: 2
Start Page Number: 139
End Page Number: 157
Publication Date: Feb 1998
Journal: Computers and Operations Research
Authors: ,
Keywords: programming: multiple criteria
Abstract:

This article describes a method for adjusting into integral form the noninteger compromise solutions obtained via DINAS to interactively solve 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 observation and manipulation of the decision variable values of the compromise solutions.

Reviews

Required fields are marked *. Your email address will not be published.