Connectedness in Multiple Linear Fractional Programming

E. U. Choo and D. R. Atkins
Additional contact information
E. U. Choo: Simon Fraser University
D. R. Atkins: University of British Columbia

Management Science, 1983, vol. 29, issue 2, 250-255

Abstract: The geometric properties of the sets of efficient and weakly efficient solutions of multiple linear fractional programming problems are investigated. Weakly efficient solutions are path-connected by finitely many linear line segments when the constrained region is compact.

Keywords: programming:; multiple; criteria (search for similar items in EconPapers)
Date: 1983
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.29.2.250 (application/pdf)

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:inm:ormnsc:v:29:y:1983:i:2:p:250-255

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().