A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints
From MaRDI portal
Publication:1652440
DOI10.1016/j.cor.2017.07.015zbMath1391.90406OpenAlexW2741201096MaRDI QIDQ1652440
Masoud Talebian, Hadi Charkhgard, Savelsbergh, Martin W. P.
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2017.07.015
linear programmingconvex programmingpolynomial-time algorithmPareto optimal solutionsmulti-linear objective function
Related Items (12)
THE MAGIC OF NASH SOCIAL WELFARE IN OPTIMIZATION: DO NOT SUM, JUST MULTIPLY! ⋮ A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach ⋮ 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 robust biobjective optimization approach for operating a shared energy storage under price uncertainty ⋮ 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 ⋮ A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs ⋮ Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs ⋮ An objective penalty function method for biconvex programming ⋮ A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On finding representative non-dominated points for bi-objective integer network flow problems
- An outcome-space finite algorithm for solving linear multiplicative programming
- Bound sets for biobjective combinatorial optimization problems
- Geometric algorithms and combinatorial optimization
- Nonsymmetric Nash solutions and replications of 2-person bargaining
- Global optimization of multiplicative programs
- An objective space cut and bound algorithm for convex multiplicative programmes
- Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes
- Polyhedral approximations inp-order cone programming
- The Bargaining Problem
- Consensus of Subjective Probabilities: The Pari-Mutuel Method
- Rational Convex Programs and Efficient Algorithms for 2-Player Nash and Nonsymmetric Bargaining Games
- The notion of a rational convex program, and an algorithm for the arrow-debreu Nash bargaining game
- On Polyhedral Approximations of the Second-Order Cone
- Two-Person Cooperative Games
This page was built for publication: A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints
