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

A general alternative procedure for solving negative degree of difficulty problems in geometric programming

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

DOI10.1023/B:COAP.0000004981.17496.9CzbMath1045.90062MaRDI QIDQ1424794

J. L. Alejandre, Jose Miguel Gonzalez, A. I. Allueva

Publication date: 15 March 2004

Published in: Computational Optimization and Applications (Search for Journal in Brave)


zbMATH Keywords

nonlinear optimizationcomputational algorithmgeometric programmingdegree of difficulty


Mathematics Subject Classification ID

Nonlinear programming (90C30)


Related Items (2)

A general algorithm for solving generalized geometric programming with nonpositive degree of difficulty ⋮ A tutorial on geometric programming







This page was built for publication: A general alternative procedure for solving negative degree of difficulty problems in geometric programming

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1424794&oldid=13592160"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 31 January 2024, at 17:36.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki