Pages that link to "Item:Q799488"
From MaRDI portal
The following pages link to A comparison between a primal and a dual cutting plane algorithm for posynomial geometric programming problems (Q799488):
Displaying 5 items.
- Adding activities to the dual instead of cuts to the primal problem (Q1097165) (← links)
- On geometric programming and complementary slackness (Q1321217) (← links)
- A nontangential cutting plane algorithm (Q1612001) (← links)
- A new two-level linear relaxed bound method for geometric programming problems (Q1774846) (← links)
- Primal-dual simplex method for shooting (Q2883641) (← links)