Minimizing the product of two discrete convex functions

zbMATH Open0885.90082MaRDI QIDQ1376689FDOQ1376689

Authors: J. Ning 

Publication date: 21 January 1998

Published in: Acta Mathematica Vietnamica (Search for Journal in Brave)

Recommendations

• A parametric successive underestimation method for convex multiplicative programming problems
• Linear multiplicative programming
• Generalized convex multiplicative programming via quasiconcave minimization
• scientific article; zbMATH DE number 757680

zbMATH Keywords

supermatroiddiscrete convex multiplicative programmingproduct of two discrete separable convex functions

Mathematics Subject Classification ID

Convex programming (90C25) Integer programming (90C10)

Cited In (4)

• The complexity of minimizing the difference of two \(M^{\natural}\)-convex set functions
• Minimizing the sum of a convex function and the product of two affine functions over a convex set
• Title not available (Why is that?)
• An outcome space algorithm for minimizing the product of two convex functions over a convex set

This page was built for publication: Minimizing the product of two discrete convex functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1376689)