Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Using bisection method for solving linear bilevel programming problems

From MaRDI portal
Publication:4609334
Jump to:navigation, search

zbMATH Open1386.90115MaRDI QIDQ4609334FDOQ4609334


Authors: Almas Jahanshahloo, Majid Zohrehbandian Edit this on Wikidata


Publication date: 29 March 2018





Recommendations

  • A cutting plane approach for solving linear bilevel programming problems
  • Numerical solution of a linear bilevel problem
  • Numerical solution of a class of bilevel programming problems
  • A method for solving bilevel linear programming problems
  • The bilevel linear/linear fractional programming problem


zbMATH Keywords

quadratic programmingbisection methodbilevel programming problem


Mathematics Subject Classification ID

Methods of successive quadratic programming type (90C55) Nonconvex programming, global optimization (90C26)



Cited In (3)

  • A new method to solve bi-level quadratic linear fractional programming problems
  • Title not available (Why is that?)
  • A cutting plane approach for solving linear bilevel programming problems





This page was built for publication: Using bisection method for solving linear bilevel programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4609334)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4609334&oldid=18772169"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 7 February 2024, at 13:59. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki