A Cutting Plane Approach for Solving Linear Bilevel Programming Problems

Modified bisection method for solving nonlinear equations

“…Also fixed point iteration method is root finding method of ( ) = 0 using the form of ( ) = , in which a sequence is generated so that it converges to a root. The bisection method [3,4,5,6,7] is one of root finding method. Cut half of the interval and use the Intermediate Value Theorem [8] to select the small sub-interval, where the root is present.…”