Connectedness in Multiple Linear Fractional Programming

descriptionPublicationkeyboard_double_arrow_right Article 01 Feb 1983 English Publisher:Institute for Operations Research and the Management Sciences (INFORMS)Journal:Management Science, volume 29, pages 250-255 (issn: 0025-1909, eissn: 1526-5501,

Copyright policy )

Authors: E. U. Choo; D. R. Atkins;

doi: 10.1287/mnsc.29.2.250

Connectedness in Multiple Linear Fractional Programming

- Summary
- Subjects
- Metrics

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.

Related Organizations

Simon Fraser University
Canada
University of British Columbia
Canada

Keywords

weakly efficient solutions, Linear programming, Sensitivity, stability, parametric optimization, linear fractional multicriteria programming, multiple criteria [programming], Fractional programming, path-connectedness

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	44
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average