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

A bilevel linear programming problem with bottleneck objectives

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

zbMATH Open0815.90120MaRDI QIDQ1342871FDOQ1342871

Munish C. Puri, Kanchan Mathur

Publication date: 15 January 1995

Published in: Opsearch (Search for Journal in Brave)





Recommendations

  • A bilevel bottleneck programming problem
  • The bilevel linear/linear fractional programming problem
  • On the quasiconcave bilevel programming problem
  • Optimality conditions for the bilevel programming problem
  • Bilevel problems over polyhedra with extreme point optimal solutions


zbMATH Keywords

bilevel programminglinear constraintssum of two concave bottleneck functions


Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)



Cited In (4)

  • The bilevel linear/linear fractional programming problem
  • Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
  • Nonlinear one-parametric bottleneck linear programming
  • Bicriteria bottleneck linear programming problem





This page was built for publication: A bilevel linear programming problem with bottleneck objectives

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

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