Connectedness in Multiple Linear Fractional Programming
研究多线性分式规划问题中有效解和弱有效解集合的几何性质，发现当约束区域紧致时，弱有效解可通过有限条直线段路径连通。
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.