A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach

DOI10.1016/j.cor.2018.08.004zbMath1458.90573OpenAlexW2885892355WikidataQ129414537 ScholiaQ129414537MaRDI QIDQ1628068

Hadi Charkhgard, Changhyun Kwon, Payman Ghasemi Saghand

Publication date: 3 December 2018

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

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

zbMATH Keywords

branch-and-bound algorithmlinear programmingmulti-objective optimizationoptimization over the efficient setmultiplicative programming

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Multi-objective and goal programming (90C29)

Related Items (10)

An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program ⋮ THE MAGIC OF NASH SOCIAL WELFARE IN OPTIMIZATION: DO NOT SUM, JUST MULTIPLY! ⋮ A Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative Programs ⋮ Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization ⋮ Solving multiplicative programs by binary-encoding the multiplication operation ⋮ A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach ⋮ An exact criterion space search algorithm for a bi-objective blood collection problem ⋮ Solving Multiobjective Mixed Integer Convex Optimization Problems ⋮ Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs ⋮ A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems

Uses Software

• CPLEX
• MOIP_AIRA

Cites Work

• Unnamed Item
• On finding representative non-dominated points for bi-objective integer network flow problems
• An exact algorithm for biobjective mixed integer linear programming problems
• Finding all nondominated points of multi-objective integer programs
• An outcome-space finite algorithm for solving linear multiplicative programming
• Bound sets for biobjective combinatorial optimization problems
• Geometric algorithms and combinatorial optimization
• Global optimization of multiplicative programs
• A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints
• Multi-objective branch and bound
• The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs
• A new method for optimizing a linear function over the efficient set of a multiobjective integer program
• Solving large MINLPs on computational grids
• Branching rules revisited
• An objective space cut and bound algorithm for convex multiplicative programmes
• A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
• An algorithm for optimizing a linear function over an integer efficient set
• Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes
• The Bargaining Problem
• An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs
• Consensus of Subjective Probabilities: The Pari-Mutuel Method
• An Automatic Method of Solving Discrete Programming Problems
• Bicriteria Transportation Problem
• Rational Convex Programs and Efficient Algorithms for 2-Player Nash and Nonsymmetric Bargaining Games
• Multicriteria Optimization
• The notion of a rational convex program, and an algorithm for the arrow-debreu Nash bargaining game
• Mixed-integer nonlinear optimization
• An Algorithm for the Traveling Salesman Problem
• Experiments in mixed-integer linear programming
• On Polyhedral Approximations of the Second-Order Cone
• Two-Person Cooperative Games
• Optimization over the efficient set
• Benchmarking optimization software with performance profiles.

This page was built for publication: A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach