A comparison between a primal and a dual cutting plane algorithm for posynomial geometric programming problems

From MaRDI portal

(Redirected from A comparison between a primal and a dual cutting plane algorithm for posynomial geometric programming problems)

Jump to:navigation, search

WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=A_comparison_between_a_primal_and_a_dual_cutting_plane_algorithm_for_posynomial_geometric_programming_problems&oldid=64463172"