Vector maximization with two objective functions

DOI10.1007/BF00933245zbMath0372.90126MaRDI QIDQ1244175

Harold P. Benson

Publication date: 1979

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Mathematics Subject Classification ID

Mathematical programming (90C99)

Related Items (21)

On a constructive approximation of the efficient outcomes in bicriterion vector optimization ⋮ Efficient approximate representation of bi-objective tradeoff sets ⋮ Characterizing the nondominated set by separable functions ⋮ A graphical bicriteria approach to the resource allocation problem ⋮ An outcome-space finite algorithm for solving linear multiplicative programming ⋮ An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming ⋮ Unnamed Item ⋮ Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem ⋮ The cross-entropy method for solving bi-criteria network flow problems in discrete-time dynamic networks ⋮ Global algorithm for a class of multiplicative programs using piecewise linear approximation technique ⋮ Bicriteria linear fractional programming ⋮ Exploring the trade-off between generalization and empirical errors in a one-norm SVM ⋮ An algorithm for bicriterion linear programming ⋮ Global optimization for generalized linear multiplicative programming using convex relaxation ⋮ Solving a class of multiplicative programs with 0-1 knapsack constraints ⋮ On a bicriterion server allocation problem in a multidimensional Erlang loss system ⋮ Generating the weakly efficient set of nonconvex multiobjective problems ⋮ A note on bicriterion programming ⋮ SVM classification for imbalanced data sets using a multiobjective optimization framework ⋮ Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem ⋮ Optimization over the efficient set: Four special cases

Cites Work

• The set of all nondominated solutions in linear cases and a multicriteria simplex method
• Linear multiobjective programming
• Proper efficiency and the theory of vector maximization
• Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
• The Vector Maximization Problem: Proper Efficiency and Stability
• Solving Bicriterion Mathematical Programs
• Technical Note—Parametric Solution of a Class of Nonconvex Programs

This page was built for publication: Vector maximization with two objective functions