A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach

DOI10.1111/itor.12964OpenAlexW3136792497MaRDI QIDQ6071088

Hadi Charkhgard, Payman Ghasemi Saghand

Publication date: 27 November 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12964

zbMATH Keywords

multiobjective optimizationoptimization over the efficient setcriterion space search algorithmmixed integer maximum multiplicative programming

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (1)

Learn to decompose multiobjective optimization models for large‐scale networks

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
• Multiplicative programming problems: Analysis and efficient point search heuristic
• Global optimization of multiplicative programs
• Local branching
• 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
• 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
• An objective space cut and bound algorithm for convex multiplicative programmes
• Multi-objective integer programming: an improved recursive algorithm
• 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
• The feasibility pump
• 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
• Solving scalarized multi-objective network flow problems using an interior point method
• The Bargaining Problem
• Quantitative Comparison of Approximate Solution Sets for Multicriteria Optimization Problems with Weighted Tchebycheff Preference Function
• An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs
• Consensus of Subjective Probabilities: The Pari-Mutuel Method
• Diversity Maximization Approach for Multiobjective Optimization
• A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors
• Optimizing Over the Efficient Set Using a Top-Down Search of Faces
• Error Detecting and Error Correcting Codes
• Rational Convex Programs and Efficient Algorithms for 2-Player Nash and Nonsymmetric Bargaining Games
• Multi‐objective optimization using metaheuristics: non‐standard algorithms
• Generating a Representative Subset of the Nondominated Frontier in Multiple Criteria Decision Making
• Multicriteria Optimization
• 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
• Optimization over the efficient set
• Benchmarking optimization software with performance profiles.

This page was built for publication: A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach