Geometric programming problems with negative degrees of difficulty

DOI10.1016/0377-2217(87)90175-5zbMath0677.90059OpenAlexW1969430938MaRDI QIDQ1123809

S. H. Smith

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0377-2217(87)90175-5

zbMATH Keywords

approximate solutionleast squarenegative degrees of difficultyposynomial geometric programs

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Linear programming (90C05) Mathematical programming (90C99)

Related Items (5)

Multi-objective marketing planning inventory model: a geometric programming approach ⋮ A general algorithm for solving generalized geometric programming with nonpositive degree of difficulty ⋮ Geometric programming problems with triangular and trapezoidal twofold uncertainty distributions ⋮ Modified geometric programming problem and its applications ⋮ On geometric programming problems having negative degrees of difficulty

Cites Work

• Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Geometric programming problems with negative degrees of difficulty