Algorithms for the vector maximization problem
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3298478 (Why is no real title available?)
- scientific article; zbMATH DE number 3308840 (Why is no real title available?)
- scientific article; zbMATH DE number 3069611 (Why is no real title available?)
- Management models and industrial applications of linear programming
- Proper efficiency and the theory of vector maximization
Cited in
(only showing first 100 items - show all)- A general method for determining the set of all efficient solutions to a linear vectormaximum problem
- Generating all maximal efficient faces for multiple objective linear programs
- Further analysis of an outcome set-based algorithm for multiple-objective linear programming
- On optimization over the efficient set of a multiple objective linear programming problem
- Dual approach to minimization on the set of Pareto-optimal solutions
- Finding all maximal efficient faces in multiobjective linear programming
- Determination of the efficient set in multiobjective linear programming
- An efficient branch-and-bound algorithm to optimize a function over a nondominated set
- A method for constructing the polar cone of a polyhedral cone, with applications to linear multicriteria decision problems
- Finding all efficient extreme points for multiple objective linear programs
- On a domination property for vector maximization with respect to cones
- A linear fractional optimization over an integer efficient set
- A long range forestry planning problem with multiple objectives
- 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
- Outcome space partition of the weight set in multiobjective linear programming
- An interactive method as an aid in solving multi-objective mathematical programming problems
- Optimizing over the properly efficient set of convex multi-objective optimization problems
- ON THE PROJECTION OF THE EFFICIENT SET AND POTENTIAL APPLICATIONS
- Inverse programming: Theory and examples
- A genetics algorithms for optimizing a function over the integer efficient set
- An algorithm for optimizing a linear function over an integer efficient set
- A revised simplex method for linear multiple objective programs
- Inverse programming and the linear vector maximization problem
- An inertial extrapolation method for convex simple bilevel optimization
- Optimizing over Pareto set of semistrictly quasiconcave vector maximization and application to stochastic portfolio selection
- An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program
- New closedness results for efficient sets in multiple objective mathematical programming
- An adaptation of PRIAM to multiobjective linear programming
- Linear programming with partial information
- On DC optimization algorithms for solving minmax flow problems
- DC programming: overview.
- A fuzzy multiobjective linear programming
- On efficient sets in vector maximum problems - A brief survey
- Quadratic optimization over a discrete Pareto set of a multi-objective linear fractional program
- An algorithm for systems welfare interactive goal programming modelling
- Solving Optimization Problems over the Weakly Efficient Set
- Solving bilevel linear programs using multiple objective linear programming
- Optimization over the efficient set using an active constraint approach
- Stability in vector maximization - a survey
- 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
- Duality theory for the matrix linear programming problem
- An exact minimax penalty function method and saddle point criteria for nonsmooth convex vector optimization problems
- An all-linear programming relaxation algorithm for optimizing over the efficient set
- Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets
- Duality for nonlinear multiple-criteria optimization problems
- Optimization over the efficient set of multi-objective convex optimal control problems
- A procedure for worst outcomes displacement in multiple criteria decision making
- The maximization of a function over the efficient set via a penalty function approach
- Convergence and application of a decomposition method using duality bounds for nonconvex global optimization
- Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
- On minimization over weakly efficient sets
- Testing for complete efficiency in a vector maximization problem
- Random problem genertion and the computation of efficient extreme points in multiple objective linear programming
- Simplicially-constrained DC optimization over efficient and weakly efficient sets
- Complete efficiency and the initialization of algorithms for multiple objective programming
- Theory and algorithms for linear multiple objective programs with zero–one variables
- The attainment of the solution of the dual program in vertices for vectorial linear programs
- An Algorithm For Solving Multiple Objective Integer Linear Programming Problem
- The maximal descriptor index set for a face of a convex polyhedral set and some applications
- Optimization over the efficient set: Four special cases
- A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
- Optimizing a linear function over an efficient set
- An algorithm for optimizing over the weakly-efficient set
- Utility function programs and optimization over the efficient set in multiple-objective decision making
- Linear multiple objective programs with zero–one variables
- Optimality conditions for semivectorial bilevel convex optimal control problems
- Approximating the noninferior set in multiobjective linear programming problems
- Optimization over the efficient set
- Application of primitive sets to multi-criteria optimization problems
- A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case
- The structure of admissible points with respect to cone dominance
- An improved algorithm to compute the -primality
- The augmented weighted Tchebychev norm for optimizing a linear function over an integer efficient set of a multicriteria linear program
- Vector maximization at a degenerate vertex
- A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets
- Transformation and restructuring of linear multiobjective programs: A fundamental method to resolve complex problems
- Solution of the linear inverse vector optimization problem by a single linear program
- Methods for optimizing over the efficient and weakly efficient sets of an affine fractional vector optimization program
- Admissible points of a convex polyhedron
- Multiplicative programming problems: Analysis and efficient point search heuristic
- An algorithm for the multiple objective integer linear programming problem
- Semivectorial bilevel optimization problem: penalty approach
- Hybrid approach for solving multiple-objective linear programs in outcome space
- Parallel optimization over the integer efficient set
- Optimization over the Pareto front of nonconvex multi-objective optimal control problems
- Stochastic optimization over a Pareto set associated with a stochastic multi-objective optimization problem
- Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
- Semivectorial bilevel optimization on Riemannian manifolds
- A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem
- Optimization over the efficient set
- Approximating the noninferior set in linear biobjective programs using multiparametric decomposition
- Connections between single-level and bilevel multiobjective optimization
- Minimization of a quasi-concave function over an efficient set
- Solving multiple objective linear programs in objective space
- Fuzzy optimization: An appraisal
- Numerical solution for optimization over the efficient set by d.c. optimization algorithms
- Post-Pareto analysis and a new algorithm for the optimal parameter tuning of the elastic net
This page was built for publication: Algorithms for the vector maximization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4777055)