A new mixed integer programming approach for optimization over the efficient set of a multiobjective linear programming problem
DOI10.1007/S11590-020-01554-7zbMATH Open1460.90170OpenAlexW3008832312MaRDI QIDQ2228402FDOQ2228402
Authors: Kuan Lu, Shinji Mizuno, Jianming Shi 
Publication date: 17 February 2021
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-020-01554-7
Recommendations
- On optimization over the efficient set of a multiple objective linear programming problem
- An algorithm for optimizing a linear function over an integer efficient set
- A method for optimizing over the integer efficient set
- Optimization over an integer efficient set of a multiple objective linear fractional problem
- Optimizing a linear function over an efficient set
global optimizationmixed integer programmingmultiobjective programmingefficient setlinear complementarity conditions
Cites Work
- Title not available (Why is that?)
- Polynomial algorithms in linear programming
- Title not available (Why is that?)
- Algorithms for the vector maximization problem
- Optimization over the efficient set: overview
- A mixed integer programming approach for the minimum maximal flow
- Optimization over the efficient set
- On linear programs with linear complementarity constraints
- A global optimization method for minimum maximal flow problem
- Minimum maximal flow problem: An optimization over the efficient set
- Numerical solution for optimization over the efficient set by d.c. optimization algorithms
- On DC optimization algorithms for solving minmax flow problems
- A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
- An algorithm for optimizing over the weakly-efficient set
- Bisection search algorithm for optimizing over the efficient set
- Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
- An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem
- Convex analysis and global optimization
- Dual approach to minimization on the set of Pareto-optimal solutions
- Minimization of a quasi-concave function over an efficient set
- On optimization over the efficient set of a multiple objective linear programming problem
- Efficiency in multiple objective optimization problems
- Primal and dual algorithms for optimization over the efficient set
Cited In (8)
- Optimizing over Pareto set of semistrictly quasiconcave vector maximization and application to stochastic portfolio selection
- A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints
- On the relationship between the value function and the efficient frontier of a mixed integer linear optimization problem
- A method for generating a well-distributed Pareto set in multiple objective mixed integer linear programs based on the decision maker's initial aspiration level
- Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs
- Diversity Maximization Approach for Multiobjective Optimization
- On optimization over the efficient set of a multiple objective linear programming problem
- A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs
This page was built for publication: A new mixed integer programming approach for optimization over the efficient set of a multiobjective linear programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2228402)
