Vector maximization with two objective functions

DOI10.1007/BF00933245MaRDI QIDQ1244175zbMATH OpenFDO

Authors Harold P. Benson

Publication date 1979

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

Full work available at URL https://doi.org/10.1007/BF00933245

Mathematics Subject Classification ID

Mathematical programming (90C99)

Cites work

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

Cited in

(26)

• Characterizing the nondominated set by separable functions
• A graphical bicriteria approach to the resource allocation problem
• Bicriteria linear fractional programming
• An algorithm for bicriterion linear programming
• Optimization over the efficient set: Four special cases
• On a constructive approximation of the efficient outcomes in bicriterion vector optimization
• Efficient approximate representation of bi-objective tradeoff sets
• Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
• Global optimization for generalized linear multiplicative programming using convex relaxation
• Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
• Solving a class of multiplicative programs with 0-1 knapsack constraints
• On a bicriterion server allocation problem in a multidimensional Erlang loss system
• Global algorithm for a class of multiplicative programs using piecewise linear approximation technique
• The cross-entropy method for solving bi-criteria network flow problems in discrete-time dynamic networks
• A note on bicriterion programming
• An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming
• Exploring the trade-off between generalization and empirical errors in a one-norm SVM
• scientific article; zbMATH DE number 7312765 (Why is no real title available?)
• Output-space outer approximation branch-and-bound algorithm for a class of linear multiplicative programs
• An adaptive optimization algorithm to solve a class of linear multiplicative problems
• Output-space branch-and-bound reduction algorithm for solving generalized linear multiplicative programming programs
• Output-space branch-and-bound algorithm adopting an adaptive branching rule for solving general linear fractional-multiplicative programs
• Globally minimizing a class of fractional multiplicative problems using the separability of relaxation problem
• SVM classification for imbalanced data sets using a multiobjective optimization framework
• An outcome-space finite algorithm for solving linear multiplicative programming
• Generating the weakly efficient set of nonconvex multiobjective problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1244175)