A new mixed integer programming approach for optimization over the efficient set of a multiobjective linear programming problem
From MaRDI portal
Publication:2228402
DOI10.1007/s11590-020-01554-7zbMath1460.90170OpenAlexW3008832312MaRDI QIDQ2228402
Kuan Lu, Jianming Shi, Shinji Mizuno
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
global optimizationmultiobjective programmingmixed integer programmingefficient setlinear complementarity conditions
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On DC optimization algorithms for solving minmax flow problems
- An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem
- On linear programs with linear complementarity constraints
- On optimization over the efficient set of a multiple objective linear programming problem
- Optimization over the efficient set: overview
- Minimization of a quasi-concave function over an efficient set
- An algorithm for optimizing over the weakly-efficient set
- A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
- A global optimization method for minimum maximal flow problem
- Minimum maximal flow problem: An optimization over the 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
- Dual approach to minimization on the set of Pareto-optimal solutions
- Numerical solution for optimization over the efficient set by d.c. optimization algorithms
- Polynomial algorithms in linear programming
- Efficiency in multiple objective optimization problems
- Primal and dual algorithms for optimization over the efficient set
- Algorithms for the vector maximization problem
- Convex analysis and global optimization
- Optimization over the efficient set
