A Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative Programs

DOI10.1287/ijoc.2021.1097OpenAlexW4206091902MaRDI QIDQ5087716

Yu Zhang, Payman Ghasemi Saghand, Vahid Mahmoodian, Iman Dayarian, Hadi Charkhgard

Publication date: 1 July 2022

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2021.1097

zbMATH Keywords

multiobjective optimizationoptimization over the efficient setmixed integer programmingNash social welfaremaximum multiplicative programming

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Uses Software

• CPLEX

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
• SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems
• A coordinating contract for transshipment in a two-company supply chain
• 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
• 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
• Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs
• A general branch-and-bound framework for continuous global multiobjective optimization
• An objective space cut and bound algorithm for convex multiplicative programmes
• Computing the nadir point for multiobjective discrete optimization problems
• An algorithm for optimizing a linear function over an integer efficient set
• Game-theoretic analysis of cooperation among supply chain agents: Review and extensions
• Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization
• Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes
• A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method
• The Bargaining Problem
• A Bargaining Framework in Supply Chains: The Assembly Problem
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Optimizing Over the Efficient Set Using a Top-Down Search of Faces
• A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
• Rational Convex Programs and Efficient Algorithms for 2-Player Nash and Nonsymmetric Bargaining Games
• A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs
• A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method
• The notion of a rational convex program, and an algorithm for the arrow-debreu Nash bargaining game
• Optimization over the efficient set
• Benchmarking optimization software with performance profiles.

This page was built for publication: A Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative Programs