A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem
From MaRDI portal
Publication:555995
DOI10.1007/s10898-003-3784-7zbMath1177.90361OpenAlexW2037554859MaRDI QIDQ555995
Publication date: 13 June 2005
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-003-3784-7
global optimizationbilinear programmingmultiple objective linear programmingoptimization over efficient sets
Related Items (10)
A multiple objective programming approach to linear bilevel multi-follower programming ⋮ Optimizing over the properly efficient set of convex multi-objective optimization problems ⋮ Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables ⋮ An algorithm for optimizing a linear function over an integer efficient set ⋮ Optimizing a linear function over the nondominated set of multiobjective integer programs ⋮ Parallel optimization over the integer efficient set ⋮ Methods for optimizing over the efficient and weakly efficient sets of an affine fractional vector optimization program ⋮ Solving bilevel linear programs using multiple objective linear programming ⋮ An exact method for computing the nadir values in multiple objective linear programming ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computational experience concerning payoff tables and minimum criterion values over the efficient set
- An all-linear programming relaxation algorithm for optimizing over the efficient set
- Complete efficiency and the initialization of algorithms for multiple objective programming
- A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
- Optimization over the efficient set: Four special cases
- Optimizing a linear function over an efficient set
- Maximal descriptor set characterizations of efficient faces in multiple objective linear programming.
- A symmetrical linear maxmin approach to disjoint bilinear programming
- Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
- Faces of a polyhedron
- Optimizing Over the Efficient Set Using a Top-Down Search of Faces
- A revised simplex method for linear multiple objective programs
- Algorithms for the vector maximization problem
- Convex Analysis
- Optimization over the efficient set
- Concavity cuts for disjoint bilinear programming
This page was built for publication: A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem
