A Branch-and-Bound Algorithm for Representative Integer Efficient Solutions in Multiple Objective Network Programming Problems

Mingue Sun
Additional contact information
Mingue Sun: The University of Texas at San Antonio

No 7, Working Papers from College of Business, University of Texas at San Antonio

Abstract: In many applications of multiple objective network programming problems, only integer solutions are acceptable as the final optimal solution. Representative efficient solutions are usually obtained by sampling the efficient set through the solution of augmented weighted Tchebycheff network programs. Because such efficient solutions are usually not integer solutions, a branch-and-bound algorithm is developed to find integer efficient solutions. The purpose of the branch-and-bound algorithm is to support interactive procedures by generating representative integer efficient solutions. To be computationally efficient, the algorithm takes advantage of the network structure as much as possible. An algorithm, used in the branch-and-bound algorithm and performed on the spanning tree, is developed to construct feasible solutions from infeasible solutions and basic solutions from nonbasic solutions when bounds on branching variables change. The branch-and-bound algorithm finds either supported or unsupported integer efficient solutions as long as they are optimal. Details of the algorithm are presented, an example is provided and computational results are reported. Computational results show that the algorithm is very powerful.

Keywords: Network Flow Algorithms; Multiple Objective Programming; Multiple Criteria Decision Making; Integer Programming; Branch-and-Bound (search for similar items in EconPapers)
JEL-codes: C14 C61 (search for similar items in EconPapers)
Pages: 30 pages
Date: 2010-03-02
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://interim.business.utsa.edu/wps/mss/0007MSS-061-2010.pdf Full text (application/pdf)
Our link check indicates that this URL is bad, the error code is: 404 Not Found

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:tsa:wpaper:0028mss

Access Statistics for this paper

More papers in Working Papers from College of Business, University of Texas at San Antonio Contact information at EDIRC.
Bibliographic data for series maintained by Wendy Frost ().