On optimization over the efficient set of a multiple objective linear programming problem

DOI10.1007/s10957-016-1030-yzbMath1357.65077OpenAlexW2540322577MaRDI QIDQ511973

Erjiang Sun

Publication date: 23 February 2017

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-016-1030-y

zbMATH Keywords

global optimizationweakly efficient setmixed-integer programmingefficient setmultiple objective linear programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items (1)

A new mixed integer programming approach for optimization over the efficient set of a multiobjective linear programming problem

Cites Work

• An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem
• Optimization over the efficient set: overview
• Minimization of a quasi-concave function over an efficient set
• Simplicial branch-and-reduce algorithm for convex programs with a multiplicative constraint
• Branch-and-reduce algorithm for convex programs with additional multiplicative constraints
• An algorithm for optimizing over the weakly-efficient set
• A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
• Optimizing a linear function over an efficient set
• Maximizing a concave function over the efficient or weakly-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
• 50 Years of Integer Programming 1958-2008
• Algorithms for the vector maximization problem
• Some Remarks on Bi-level Vector Extremum Problems
• Optimization over the efficient set
• Unnamed Item

This page was built for publication: On optimization over the efficient set of a multiple objective linear programming problem