Pages that link to "Item:Q2544126"

The following pages link to On the primal and dual constraint sets in geometric programming (Q2544126):

Displaying 5 items.

• Clark's theorem for semi-infinite convex programs (Q1150527) (← links)
• On geometric programming problems having negative degrees of difficulty (Q1309928) (← links)
• On controlling the parameter in the logarithmic barrier term for convex programming problems (Q1893461) (← links)
• The complementary unboundedness of dual feasible solution sets in convex programming (Q4138493) (← links)
• On a classification scheme for geometric programming and complementarity theorems†^† (Q4143032) (← links)