Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
From MaRDI portal
(Redirected from Publication:1908646)
Recommendations
- Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
- An algorithm for generating the efficient outcome set in bi-criteria linear programming problems and applications
- Generating the efficient outcome set in multiple objective linear programs: The bicriteria case
- A parametric simplex method for optimizing a linear function over the efficient set of bicriteria linear problem
Cites work
- scientific article; zbMATH DE number 3936913 (Why is no real title available?)
- scientific article; zbMATH DE number 3945836 (Why is no real title available?)
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- scientific article; zbMATH DE number 47153 (Why is no real title available?)
- scientific article; zbMATH DE number 47262 (Why is no real title available?)
- scientific article; zbMATH DE number 553773 (Why is no real title available?)
- scientific article; zbMATH DE number 219844 (Why is no real title available?)
- scientific article; zbMATH DE number 757675 (Why is no real title available?)
- scientific article; zbMATH DE number 3090557 (Why is no real title available?)
- A Heuristic for Estimating Nadir Criterion Values in Multiple Objective Linear Programming
- 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 geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions
- A multi-run interactive method for bicriterion optimization problems
- A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program
- A survey of multicriteria optimization or the vector maximum problem. I: 1776-1960
- Admissible points of a convex polyhedron
- Algorithms for the vector maximization problem
- An Algorithm for Solving Multicriterion Linear Programming Problems with Examples
- An Existence Theorem in Vector Optimization
- An Interactive Method as an Aid in Solving Bicriterion Mathematical Programming Problems
- An Overview of Techniques for Solving Multiobjective Mathematical Programs
- An algorithm for bicriterion linear programming
- An algorithm for optimizing over the weakly-efficient set
- An all-linear programming relaxation algorithm for optimizing over the efficient set
- An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming
- Analysis of the objective space in multiple objective linear programming
- Bicriteria Transportation Problem
- Careful usage of pessimistic values is needed in multiple objectives optimization
- Complete efficiency and the initialization of algorithms for multiple objective programming
- Computational experience concerning payoff tables and minimum criterion values over the efficient set
- Constructing the set of efficient objective values in multiple objective linear programs
- Convex Analysis
- Deterministic methods in constrained global optimization: Some recent advances and new fields of application
- Handbook of global optimization
- Interactive multiple objective optimization: Survey. I: Continuous case
- Linear programming with multiple objective functions: Step method (stem)
- Minimization of a quasi-concave function over an efficient set
- Multiobjective programming and planning
- Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
- On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
- On degeneracy and collapsing in the construction of the set of objective values in a multiple objective linear program
- On the characterization of Pareto-optimal solutions in bicriterion optimization
- Optimality conditions for minimization over the (weakly or properly) efficient set
- Optimization over the efficient set
- Optimization over the efficient set using an active constraint approach
- Optimization over the efficient set: Four special cases
- Pairwise-comparison methods in multiple objective programming, with applications in a long-term energy-planning model
- Solving Bicriterion Mathematical Programs
- Solving a bicriterion scheduling problem
- Solving multiple objective linear programs in objective space
- The structure of admissible points with respect to cone dominance
- Theory of multiobjective optimization
- Vector maximization with two objective functions
Cited in
(25)- Optimizing over Pareto set of semistrictly quasiconcave vector maximization and application to stochastic portfolio selection
- DC programming: overview.
- Maximizing a linear fractional function on a Pareto efficient frontier
- Quadratic optimization over a discrete Pareto set of a multi-objective linear fractional program
- A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem
- Criteria and dimension reduction of linear multiple criteria optimization problems
- A new mixed integer programming approach for optimization over the efficient set of a multiobjective linear programming problem
- Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets
- Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
- Stochastic optimization over a Pareto set associated with a stochastic multi-objective optimization problem
- Generating equidistant representations in biobjective programming
- Existence results and optimization over the set of efficient solutions in vector-valued approximation theory
- Necessary optimality conditions for semi-vectorial bi-level optimization with convex lower level: theoretical results and applications to the quadratic case
- An algorithm for generating the efficient outcome set in bi-criteria linear programming problems and applications
- On optimization over the efficient set in linear multicriteria programming
- Primal and dual algorithms for optimization over the efficient set
- Outcome space algorithm for generalized multiplicative problems and optimization over the efficient set
- Optimal sequential inspection policies
- Combination between global and local methods for solving an optimization problem over the efficient set
- Maximizing a concave function over the efficient or weakly-efficient set
- Quantitative parametric connections between methods for generating noninferior solutions in multiobjective optimization
- On optimization over the efficient set of a multiple objective linear programming problem
- Optimization over the Pareto outcome set associated with a convex bi-objective optimization problem: theoretical results, deterministic algorithm and application to the stochastic case
- Optimization over the efficient set of a parametric multiple objective linear programming problem
- Optimizing over the properly efficient set of convex multi-objective optimization problems
This page was built for publication: Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1908646)
