The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Multiobjective bilevel linear programming is a decentralized decision problem, it consists of many objectives at the upper level and the lower level, respectively. It has a wide field of applications and has been proven to be NP-hard. In this paper, a kind of multiobjective bilevel convex programming(MBCP) is studied, in which the lower level is first transformed into an equivalent single objective...
The paper focuses on a special nonlinear bilevel programming problem (BLPP), and its characteristic is that the follower's programming is convex and quadratic, whereas there are no any additional requirements for the leader's functions. In order to solve the complex problem efficiently, it is first converted into an equivalent single-level programming by using Karush-Kuhn-Tucher (K-K-T) conditions,...
The existing shelf space allocation methods only optimize the profits without considering the sales time. Actually, the time to sale the products is important as well to retailers because the time has a significant impact on the liquidity and long-term profits of a retail shop. Hence, this paper proposes a bi-objective model, in which one objective is to maximize the total profits of all store's products...
In this paper, a hybrid genetic algorithm is proposed for solving nonlinear bilevel programming problems (BLPPs). In order to improve the feasibility of the individuals, for each fixed leader-level variable x, the follower's problem is solved to get its optimal solution y. Then, based on the simplex method, a new crossover operator is designed, in which the best individuals generated so far are employed...
In this paper, a fast computational method for a class of nonlinear bilevel programming problems is proposed. In these problems, the lower-level problem can be decomposed into some paratactic and independent sub-problems. First, by Karush-Kuhn-Tucker optimality, the stationary-points of these sub-problems corresponding to the upper-level variables can be determined. As a result, this kind of nonlinear...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.