Algorithms for the vector maximization problem
From MaRDI portal
Publication:4777055
DOI10.1007/BF01584543zbMath0288.90052OpenAlexW1981284334MaRDI QIDQ4777055
Publication date: 1972
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01584543
Related Items
ON THE PROJECTION OF THE EFFICIENT SET AND POTENTIAL APPLICATIONS, Parallel optimization over the integer efficient set, Optimization over the Pareto front of nonconvex multi-objective optimal control problems, Inverse programming: Theory and examples, Optimization over the efficient set, Optimization over the efficient set, Testing for complete efficiency in a vector maximization problem, Efficiency in multiple objective optimization problems, Optimality Conditions for Semivectorial Bilevel Convex Optimal Control Problems, Theory and algorithms for linear multiple objective programs with zero–one variables, Vector maximization at a degenerate vertex, On minimization over weakly efficient sets, Linear multiple objective programs with zero–one variables, Finding all efficient extreme points for multiple objective linear programs, Solution of the linear inverse vector optimization problem by a single linear program, An Algorithm For Solving Multiple Objective Integer Linear Programming Problem, Solving Optimization Problems over the Weakly Efficient Set, A linear fractional optimization over an integer efficient set, Quadratic optimization over a discrete pareto set of a multi-objective linear fractional program, An inertial extrapolation method for convex simple bilevel optimization, A revised simplex method for linear multiple objective programs, Interactive relaxation method for a broad class of integer and continuous nonlinear multiple criteria problems, An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program, An algorithm for optimizing over the weakly-efficient set, Branch-and-bound decomposition approach for solving quasiconvex-concave programs, Duality theory for the matrix linear programming problem, Optimizing over the properly efficient set of convex multi-objective optimization problems, An exact minimax penalty function method and saddle point criteria for nonsmooth convex vector optimization problems, Semivectorial bilevel optimization problem: penalty approach, Optimizing a linear function over an efficient set, Random problem genertion and the computation of efficient extreme points in multiple objective linear programming, Analysis of the objective space in multiple objective linear programming, An algorithm for optimizing a linear function over an integer efficient set, An adaptation of PRIAM to multiobjective linear programming, Utility function programs and optimization over the efficient set in multiple-objective decision making, A vector variational inequality and optimization over an efficient set, Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem, On the convergence of reference point methods in multiobjective programming, Multiplicative programming problems: Analysis and efficient point search heuristic, An entropy target-point approach to multiobjective programming, Dual approach to minimization on the set of Pareto-optimal solutions, A procedure for worst outcomes displacement in multiple criteria decision making, Fuzzy optimization: An appraisal, Optimization over the efficient set of multi-objective convex optimal control problems, Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets, Efficient curve fitting: an application of multiobjective programming, On DC optimization algorithms for solving minmax flow problems, Application of primitive sets to multi-criteria optimization problems, Semivectorial bilevel optimization on Riemannian manifolds, Linear programming with partial information, Duality for nonlinear multiple-criteria optimization problems, Connections between single-level and bilevel multiobjective optimization, Criteria and dimension reduction of linear multiple criteria optimization problems, Simplicially-constrained DC optimization over efficient and weakly efficient sets, Admissible points of a convex polyhedron, An algorithm for the multiple objective integer linear programming problem, On a domination property for vector maximization with respect to cones, Optimization over equilibrium sets∗, Stochastic optimization over a Pareto set associated with a stochastic multi-objective optimization problem, A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets, DC programming: overview., A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem, An all-linear programming relaxation algorithm for optimizing over the efficient set, Transformation and restructuring of linear multiobjective programs: A fundamental method to resolve complex problems, A new mixed integer programming approach for optimization over the efficient set of a multiobjective linear programming problem, Complete efficiency and the initialization of algorithms for multiple objective programming, Methods for optimizing over the efficient and weakly efficient sets of an affine fractional vector optimization program, On optimization over the efficient set of a multiple objective linear programming problem, On optimization over the efficient set in linear multicriteria programming, Weak duality theorem and complementary slackness theorem for linear matrix programming problems, Pseudolinearity and efficiency, Total unimodularity applications in bi-objective discrete optimization, An improved algorithm to compute the \(\omega\)-primality, Minimization of a quasi-concave function over an efficient set, A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case, Convergence and application of a decomposition method using duality bounds for nonconvex global optimization, A method for constructing the polar cone of a polyhedral cone, with applications to linear multicriteria decision problems, A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem, Constructing efficient solutions structure of multiobjective linear programming, An approach for finding efficient points in multiobjective linear programming, Optimizing a linear function over an integer efficient set, Post-Pareto analysis and a new algorithm for the optimal parameter tuning of the elastic net, A general method for determining the set of all efficient solutions to a linear vectormaximum problem, Optimization over the efficient set using an active constraint approach, An interactive method as an aid in solving multi-objective mathematical programming problems, The structure of admissible points with respect to cone dominance, Generating all maximal efficient faces for multiple objective linear programs, Inverse programming and the linear vector maximization problem, Solving bilevel linear programs using multiple objective linear programming, Solving multiple objective linear programs in objective space, Further analysis of an outcome set-based algorithm for multiple-objective linear programming, Hybrid approach for solving multiple-objective linear programs in outcome space, Determining maximal efficient faces in multiobjective linear programming problem, Necessary optimality conditions for semi-vectorial bi-level optimization with convex lower level: theoretical results and applications to the quadratic case, The maximization of a function over the efficient set via a penalty function approach, A fuzzy multiobjective linear programming, Approximating the noninferior set in linear biobjective programs using multiparametric decomposition, The Attainment of the Solution of the Dual Program in Vertices for Vectorial Linear Programs, Optimization over the efficient set of a parametric multiple objective linear programming problem, Numerical solution for optimization over the efficient set by d.c. optimization algorithms, Outcome space partition of the weight set in multiobjective linear programming, Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem, Maximizing a concave function over the efficient or weakly-efficient set, Combination between global and local methods for solving an optimization problem over the efficient set, On the optimal value function for certain linear programs with unbounded optimal solution sets, Optimizing over Pareto set of semistrictly quasiconcave vector maximization and application to stochastic portfolio selection, New closedness results for efficient sets in multiple objective mathematical programming, Approximating the noninferior set in multiobjective linear programming problems, The augmented weighted Tchebychev norm for optimizing a linear function over an integer efficient set of a multicriteria linear program, The maximal descriptor index set for a face of a convex polyhedral set and some applications, Finding all maximal efficient faces in multiobjective linear programming, On efficient sets in vector maximum problems - A brief survey, Optimization over the Pareto outcome set associated with a convex bi-objective optimization problem: theoretical results, deterministic algorithm and application to the stochastic case, Determination of the efficient set in multiobjective linear programming, A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set, Necessary conditions for nonlinear suboptimization over the weakly- efficient set, Optimization over the efficient set: Four special cases, An algorithm for systems welfare interactive goal programming modelling, Stability in vector maximization - a survey, A long range forestry planning problem with multiple objectives, Analysis of multicriteria decision aid in Europe
Cites Work
