On bilevel fractional programming
From MaRDI portal
Publication:4859832
DOI10.1080/02331939508844143zbMath0839.90119OpenAlexW2039202885MaRDI QIDQ4859832
Kanchan Mathur, Munish C. Puri
Publication date: 7 January 1996
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939508844143
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Hierarchical games (including Stackelberg games) (91A65) Fractional programming (90C32)
Related Items (5)
A fifth bibliography of fractional programming* ⋮ A PENALTY METHOD FOR SOLVING BILEVEL LINEAR FRACTIONAL/LINEAR PROGRAMMING PROBLEMS ⋮ A class of integer linear fractional bilevel programming problems ⋮ On the bilevel integer linear fractional programming problem. ⋮ The bilevel linear/linear fractional programming problem
Cites Work
- Unnamed Item
- A linear bilevel programming algorithm based on bicriteria programming
- Construction of a real-world bilevel linear programming model of the highway network design problem
- On the structure and properties of a linear multilevel programming problem
- The hybrid algorithm for solving the three-level linear programming problem
- Convex two-level optimization
- On the bottleneck linear programming problem
- Multi-level programming and conflict resolution
- Lexicographic bottleneck problems
- Hierarchical optimization: An introduction
- An algorithm for the mixed-integer nonlinear bilevel programming problem
- A modified simplex approach for solving bilevel linear programming problems
- A variation of the assignment problem
- A penalty function approach for solving bi-level linear programs
- Solving combinatorial problems with combined min-max-min-sum objective and applications
- On the Stackelberg strategy in nonzero-sum games
- Algorithms for the minimax transportation problem
- An Efficient Point Algorithm for a Linear Two-Stage Optimization Problem
- A solution method for the static constrained Stackelberg problem via penalty method
- A Note on: An Efficient Point Algorithm for a Linear Two-Stage Optimization Problem
- Computational Difficulties of Bilevel Linear Programming
- On three basic methods for solving bottleneck transportation problems
- Alternative Models of Spatial Competition
- A min max problem
- A new computational method for Stackelberg and min-max problems by use of a penalty method
- Projection methods for variational inequalities with application to the traffic assignment problem
- On two-level optimization
- Two-Level Linear Programming
- The Mixed Integer Linear Bilevel Programming Problem
- Two-Level Planning
- Time‐minimizing transportation problems
- Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
- The bottleneck transportation problem
- A solution method for the linear static Stackelberg problem using penalty functions
- Fractional programming
This page was built for publication: On bilevel fractional programming
