Solving multiplicative programs by binary-encoding the multiplication operation

DOI10.1016/J.COR.2023.106340MaRDI QIDQ6047881zbMATH OpenOpenAlexFDO

Authors Payman Ghasemi Saghand, Fabian Rigterink, Vahid Mahmoodian, Hadi Charkhgard

Publication date 13 September 2023

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2023.106340

zbMATH Keywords

multi-objective optimizationmulti-linear optimizationmixed integer second order cone programmingmultiplicative programbinary-encoding

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization
• Global optimization of multiplicative programs
• Global algorithm for a class of multiplicative programs using piecewise linear approximation technique
• An objective space cut and bound algorithm for convex multiplicative programmes
• Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes

Cites work

• scientific article; zbMATH DE number 5552087 (Why is no real title available?)
• scientific article; zbMATH DE number 1985302 (Why is no real title available?)
• A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach
• A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints
• An objective space cut and bound algorithm for convex multiplicative programmes
• Benchmarking optimization software with performance profiles.
• Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
• On Polyhedral Approximations of the Second-Order Cone
• Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes
• Some results on the strength of relaxations of multilinear functions
• Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program

Cited in

(1)

• Backtracking-assisted multiplication

This page was built for publication: Solving multiplicative programs by binary-encoding the multiplication operation

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