A simple Tabu search method to solve the mixed-integer linear bilevel programming problem

Article Abstract:

A heuristic algorithm called the Simple Tabu Search is formulated to solve the mixed-integer linear bilevel programming problem, where a high-level decision maker controls zero-one decision variables while a low-level decision maker controls real-value decision variables. Variations of the algorithms are used as supplementary procedures. The approach is shown to be effective in solution quality and computational efficiency.

Methods, Linear programming, Integer programming, Production planning, Heuristic programming

---

A note on a modified simplex approach for solving bilevel linear programming problems

Article Abstract:

A critique of an approach to bilevel linear programming is presented. It is suggested that the proposed algorithm causes difficulties in theoretical analysis and may not produce the solution it was claimed to produce.

Simplex method, Simplexes (Mathematics)

---

Similar abstracts:

• Abstracts: A note on efficient solutions for the linear bilevel programming problem. Investment and harvest strategies of the Finnish forest sector under different forest-tax policies: a differential game approach with computer-based decision aid
• Abstracts: An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem
• Abstracts: Using approximate gradients in developing an interactive interior primal-dual multiobjective linear programming algorithm
• Abstracts: Experiments with dynamic programming algorithms for nonseparable problems. A heuristic for finding embedded network structure in mathematical programmes
• Abstracts: Advertising a new product in a segmented market. Optimal design of a multiservice system: the line-penalty problem

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.