Our paper deals with the problem of choosing correct parameters for the bilevel linear programming solving algorithm proposed by M. Sakawa and I. Nishizaki. We suggest an approach based on factoraggregation, which is a specially designed general aggregation operator. The idea of factoraggregation arises from factorization by the equivalence relation generated by the upper level objective functi...

In this paper, we survey applications and algorithms pertaining to an important class of price setting problems formulated as bilevel programs. Introduction. Bilevel Programming. The present paper focuses on a specific class of bilevel problems that arise naturally when tariffs, tolls or devious taxes are imposed on a set of commodities. Not only does this class encompass several important opti...

By handling the travel cost function artfully, the authors formulate the transportation mixed network design problem (MNDP) as a mixed-integer, nonlinear bilevel programming problem, in which the lower-level problem, comparing with that of conventional bilevel DNDP models, is not a side constrained user equilibrium assignment problem, but a standard user equilibrium assignment problem. Then, th...

A novel neural network approach is presented for solving nonlinear bilevel programming problem. The proposed neural network is proved to be Lyapunov stable and capable of generating optimal solution to the nonlinear bilevel programming problem. The asymptotic properties of the neural network are analyzed and the condition for asymptotic stability, solution feasibility and solution optimality ar...

Bilevel optimization problems with multivalued objective functions in both levels are first replaced by a problem with a parametric lower level using a convex combination of the lower level objectives. Thus a nonconvex multiobjective bilevel optimization problem arises which is then transformed into a parametric bilevel programming problem. The investigated problem has been considered in the pa...

In this paper, we integrate goal programming (GP), Taylor Series, Kuhn-Tucker conditions and Penalty Function approaches to solve linear fractional bi-level programming (LFBLP)problems. As we know, the Taylor Series is having the property of transforming fractional functions to a polynomial. In the present article by Taylor Series we obtain polynomial objective functions which are equivalent to...