A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem
From MaRDI portal
(Redirected from Publication:555995)
Recommendations
- Optimizing a linear function over an efficient set
- Bisection search algorithm for optimizing over the efficient set
- An algorithm for optimizing a linear function over an integer efficient set
- scientific article; zbMATH DE number 592648
- An all-linear programming relaxation algorithm for optimizing over the efficient set
Cites work
- scientific article; zbMATH DE number 3825556 (Why is no real title available?)
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- scientific article; zbMATH DE number 219844 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- scientific article; zbMATH DE number 3308846 (Why is no real title available?)
- A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case
- A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
- A revised simplex method for linear multiple objective programs
- A symmetrical linear maxmin approach to disjoint bilinear programming
- Algorithms for the vector maximization problem
- An all-linear programming relaxation algorithm for optimizing over the efficient set
- Complete efficiency and the initialization of algorithms for multiple objective programming
- Computational experience concerning payoff tables and minimum criterion values over the efficient set
- Concavity cuts for disjoint bilinear programming
- Convex Analysis
- Faces of a polyhedron
- Maximal descriptor set characterizations of efficient faces in multiple objective linear programming.
- Optimization over the efficient set
- Optimization over the efficient set: Four special cases
- Optimizing Over the Efficient Set Using a Top-Down Search of Faces
- Optimizing a linear function over an efficient set
- Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
Cited in
(15)- Solving bilevel linear programs using multiple objective linear programming
- Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables
- A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints
- A multiple objective programming approach to linear bilevel multi-follower programming
- An algorithm for optimizing over the efficient set
- Conical algorithm in global optimization for optimizing over efficient sets
- Optimizing a linear function over an efficient set
- Methods for optimizing over the efficient and weakly efficient sets of an affine fractional vector optimization program
- An exact method for computing the nadir values in multiple objective linear programming
- Parallel optimization over the integer efficient set
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Optimizing a linear function over the nondominated set of multiobjective integer programs
- Optimizing over the properly efficient set of convex multi-objective optimization problems
- A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs
- An algorithm for optimizing a linear function over an integer efficient set
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q555995)
