An Effective Computational Algorithm for the Global Solution of a Class of Linear Fractional Programming

<div>Algorithm flowchart 1. <i>Note.</i> (a, b), where “a” represents the object value of the relaxation problem and “b” represents the object value of the original problem. Spherical arrows represent the termination nodes. Node box represents a corresponding reduced rectangle, and it is finally removed.</div>

Mathematical Problems in Engineering

fig1

Figure 1

Figure 1: An Effective Computational Algorithm for the Global Solution of a Class of Linear Fractional Programming 