A new method for solution of linear programming with additional multiplicative constraints

MaRDI QIDQ3501232zbMATH OpenFDO

Authors Limin Liu, Yunpeng Duan, Peiping Shen

Publication date 3 June 2008

zbMATH Keywords

multiplicative constraintsbranch and bound theoryregion-deleting principles

Mathematics Subject Classification ID

Linear programming (90C05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints
• A new method for solving a class of multiplicative programming
• A new branch and bound algorithm for linear multiplicative programming
• A deterministic approach to linear programs with several additional multiplicative constraints
• scientific article; zbMATH DE number 4053366

Cited in

(3)

• A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems
• scientific article; zbMATH DE number 3277140 (Why is no real title available?)
• scientific article; zbMATH DE number 5524675 (Why is no real title available?)

This page was built for publication: A new method for solution of linear programming with additional multiplicative constraints

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