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

On geometric programming problems having negative degrees of difficulty

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

DOI10.1016/0377-2217(93)90199-WzbMath0784.90064MaRDI QIDQ1309928

Jayant Rajgopal, Jae Chul Choi, Dennis L. Bricker

Publication date: 6 January 1994

Published in: European Journal of Operational Research (Search for Journal in Brave)


zbMATH Keywords

negative degree of difficulty


Mathematics Subject Classification ID

Nonlinear programming (90C30)


Related Items

A general algorithm for solving generalized geometric programming with nonpositive degree of difficulty, A SOLUTION TO GEOMETRIC PROGRAMMING PROBLEMS WITH NEGATIVE DEGREES OF DIFFICULTY



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Geometric programming problems with negative degrees of difficulty
  • On the primal and dual constraint sets in geometric programming
  • On a classification scheme for geometric programming and complementarity theorems††
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1309928&oldid=13425749"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 12:45.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki