On the primal and dual constraint sets in geometric programming
From MaRDI portal
Publication:2544126
DOI10.1016/0022-247X(70)90292-1zbMath0211.22304MaRDI QIDQ2544126
Alton C. Williams, Mordecai Avriel
Publication date: 1970
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Related Items (5)
On controlling the parameter in the logarithmic barrier term for convex programming problems ⋮ Clark's theorem for semi-infinite convex programs ⋮ The complementary unboundedness of dual feasible solution sets in convex programming ⋮ On a classification scheme for geometric programming and complementarity theorems†† ⋮ On geometric programming problems having negative degrees of difficulty
Cites Work
This page was built for publication: On the primal and dual constraint sets in geometric programming
