Solving multiplicative programs by binary-encoding the multiplication operation

DOI10.1016/j.cor.2023.106340OpenAlexW4382933572MaRDI QIDQ6047881

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

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)

Cites Work

• 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
• Some results on the strength of relaxations of multilinear functions
• An objective space cut and bound algorithm for convex multiplicative programmes
• Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes
• Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
• Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
• On Polyhedral Approximations of the Second-Order Cone
• Benchmarking optimization software with performance profiles.
• Unnamed Item
• Unnamed Item

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