Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes
From MaRDI portal
Publication:2790887
DOI10.1080/02331934.2015.1051534zbMath1370.90254OpenAlexW2228093837MaRDI QIDQ2790887
Publication date: 8 March 2016
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://eprints.lancs.ac.uk/id/eprint/75297/1/20150317.pdf
multi-objective optimizationapproximation algorithmlinear multiplicative programmingnondominated point
Related Items (11)
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 ⋮ 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 ⋮ A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs ⋮ A vector linear programming approach for certain global optimization problems ⋮ Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs ⋮ Solving generalized convex multiobjective programming problems by a normal direction method ⋮ Approximating a linear multiplicative objective in watershed management optimization
Cites Work
- A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming
- An approximation algorithm for convex multi-objective programming problems
- SCIP: solving constraint integer programs
- Benson type algorithms for linear vector optimization and applications
- A FPTAS for a class of linear multiplicative problems
- An outcome-space finite algorithm for solving linear multiplicative programming
- Approximating the nondominated set of an MOLP by approximately solving its dual problem
- On-line and off-line vertex enumeration by adjacency lists
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- Multiplicative programming problems: Analysis and efficient point search heuristic
- Global optimization of multiplicative programs
- Outcome-space cutting-plane algorithm for linear multiplicative programming
- A polyhedral branch-and-cut approach to global optimization
- An objective space cut and bound algorithm for convex multiplicative programmes
- \(NP\)-hardness of linear multiplicative programming and related problems
- Vector Optimization with Infimum and Supremum
- Geometric Duality in Multiple Objective Linear Programming
- A finite branch-and-bound algorithm for linear multiplicative programming
This page was built for publication: Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes
