On geometric programming problems having negative degrees of difficulty
From MaRDI portal
Recommendations
- A general alternative procedure for solving negative degree of difficulty problems in geometric programming
- Modified geometric programming problem and its applications
- scientific article; zbMATH DE number 3876494
- Geometric programming with multiplicative slack variables
- scientific article; zbMATH DE number 3971598
Cites work
- scientific article; zbMATH DE number 3695974 (Why is no real title available?)
- scientific article; zbMATH DE number 3272827 (Why is no real title available?)
- Geometric programming problems with negative degrees of difficulty
- On a classification scheme for geometric programming and complementarity theorems††
- On the primal and dual constraint sets in geometric programming
Cited in
(10)- Geometric programming with multiplicative slack variables
- On subsidiary problems in geometric programming
- scientific article; zbMATH DE number 3876494 (Why is no real title available?)
- A SOLUTION TO GEOMETRIC PROGRAMMING PROBLEMS WITH NEGATIVE DEGREES OF DIFFICULTY
- A general algorithm for solving generalized geometric programming with nonpositive degree of difficulty
- Perfect duality in solving geometric programming problems under uncertainty
- A general alternative procedure for solving negative degree of difficulty problems in geometric programming
- Modified geometric programming problem and its applications
- Controlled dual perturbations for posynomial programs
- scientific article; zbMATH DE number 4029276 (Why is no real title available?)
This page was built for publication: On geometric programming problems having negative degrees of difficulty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1309928)
