Minimizing the product of two discrete convex functions

MaRDI QIDQ1376689zbMATH OpenFDO

Authors J. Ning

Publication date 21 January 1998

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

zbMATH Keywords

supermatroiddiscrete convex multiplicative programmingproduct of two discrete separable convex functions

Mathematics Subject Classification ID

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

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

Cited in

(4)

• Minimizing the sum of a convex function and the product of two affine functions over a convex set
• An outcome space algorithm for minimizing the product of two convex functions over a convex set
• scientific article; zbMATH DE number 6438525 (Why is no real title available?)
• The complexity of minimizing the difference of two \(M^{\natural}\)-convex set functions

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)