A New Method To Solve Bi-Level Quadratic Linear Fractional Programming Problems

DOI10.1142/S0219198915400174zbMath1312.90030MaRDI QIDQ5251689

Nivedita Haldar, Sanjeet Singh

Publication date: 20 May 2015

Published in: International Game Theory Review (Search for Journal in Brave)

zbMATH Keywords

dual problemquadratic programminglinear fractional programmingbi-level programmingStackelberg gamequadratic linear fractional problem

Mathematics Subject Classification ID

Quadratic programming (90C20) Fractional programming (90C32) Management decision making, including multiple objectives (90B50)

Related Items (1)

A dual scheme for solving linear countable semi-infinite fractional programming problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stackelberg solutions for fuzzy random two-level linear programming through probability maximization with possibility
• A linear bilevel programming algorithm based on bicriteria programming
• Solving quadratic convex bilevel programming problems using a smoothing method
• Bilevel model for production-distribution planning solved by using ant colony optimization
• Bilevel programming: a survey
• Interactive approach to bi-level integer multi-objective fractional programming problem
• Some properties of the bilevel programming problem
• Interactive fuzzy goal programming approach for bilevel programming problem
• Derivative evaluation and computational experience with large bilevel mathematical programs
• A sequential LCP method for bilevel linear programming
• An algorithm for the mixed-integer nonlinear bilevel programming problem
• A penalty function approach for solving bi-level linear programs
• Descent approaches for quadratic bilevel programming
• The steepest descent direction for the nonlinear bilevel programming problem
• A note on `bilevel linear fractional programming problem'.
• Solving linear fractional bilevel programs.
• The bilevel linear/linear fractional programming problem
• A hybrid tabu-ascent algorithm for the linear bilevel programming problem
• Solving multi-level multi-objective linear programming problems through fuzzy goal programming approach
• An overview of bilevel optimization
• Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron.
• On the Stackelberg strategy in nonzero-sum games
• An Efficient Point Algorithm for a Linear Two-Stage Optimization Problem
• Fuzzy Optimality Conditions for Fractional Multiobjective Bilevel Problems Under Fractional Constraints
• A solution method for the static constrained Stackelberg problem via penalty method
• The Simplex Method for Quadratic Programming
• A Branch and Bound Algorithm for the Bilevel Programming Problem
• Computational Difficulties of Bilevel Linear Programming
• An Algorithm for Solving the General Bilevel Programming Problem
• On two-level optimization
• A linear max—min problem
• Genetic algorithm based approach to bi-level linear programming
• Two-Level Linear Programming
• The Mixed Integer Linear Bilevel Programming Problem
• Nonlinear Programming

This page was built for publication: A New Method To Solve Bi-Level Quadratic Linear Fractional Programming Problems