Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

An update on bi-level geometric programming: A new optimization model

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

DOI10.1016/0307-904X(93)90110-3zbMath0774.90066MaRDI QIDQ1801971

Richard S. Segall

Publication date: 14 November 1993

Published in: Applied Mathematical Modelling (Search for Journal in Brave)


zbMATH Keywords

branch-and-boundbi-level geometric programming


Mathematics Subject Classification ID

Nonlinear programming (90C30)


Related Items (1)

Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography



Cites Work

  • Unnamed Item
  • Using branch-and-bound to solve bi-level geometric programming problems: A new optimization model
  • Optimality conditions for the bilevel programming problem
  • An Algorithm for Solving the General Bilevel Programming Problem
  • A note on the optimality conditions for the bilevel programming problem
  • Geometric Programming: Methods, Computations and Applications


This page was built for publication: An update on bi-level geometric programming: A new optimization model

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1801971&oldid=14157000"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 09:59.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki