An algorithm for the integer linear fractional bilevel programming problem
From MaRDI portal
Publication:4331993
DOI10.1080/02331939708844271zbMath0867.90110OpenAlexW2094217595MaRDI QIDQ4331993
Publication date: 4 August 1997
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939708844271
Related Items (11)
A class of integer linear fractional bilevel programming problems ⋮ Unnamed Item ⋮ Solving discrete linear fractional bilevel programs with multiple objectives at the upper level ⋮ Global solution of nonlinear mixed-integer bilevel programs ⋮ AN ITERATIVE ALGORITHM FOR A CLASS OF NONLINEAR INTEGER BILEVEL PROGRAMMING PROBLEMS WITH BOX CONSTRAINTS ⋮ On the bilevel integer linear fractional programming problem. ⋮ A mixed-integer bilevel programming approach for a competitive prioritized set covering problem ⋮ Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints ⋮ Bilevel programming with discrete lower level problems ⋮ A sixth bibliography of fractional programming ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
Cites Work
This page was built for publication: An algorithm for the integer linear fractional bilevel programming problem