Step 1. Set . Let and be the initial lower and upper bounds of , that is, where , can be | assigned an arbitrarily sufficiently large value to make inequalities (42)–(44) have initial feasible solution set | . | Step 2. At , computer . | Step 3. Use Algorithm 3 to check whether the feasible solution set satisfying . If exists, set . | Otherwise, set . | Step 4. If , where is the assumed calculation accuracy, set optimal performance index and exit. | Otherwise, set , go to Step 2. |
|