Solving Bicriterion Mathematical Programs

Cited in

(79)

Bicriteria bottleneck linear programming problem
On the characterization of efficient points by means of monotone functionals
A new global optimization approach for convex multiplicative programming
An outer approximation method for minimizing the product of several convex functions on a convex set
New approach for nonseparable dynamic programming problems
On jet-convex functions and their tensor products
Fractional programming
Solving a class of multiplicative programs with 0-1 knapsack constraints
Maximizing a linear fractional function on a Pareto efficient frontier
On efficient sets in vector maximum problems - A brief survey
Bi-objective capacitated transportation problem with bounds over distributions and requirement capacities
On mean-standard deviation ratio problems and beyond via c-programming
Convex programs with an additional constraint on the product of several convex functions
Budget-constrained minimum cost flows
An interactive approach for vector optimization problems
An outcome-space finite algorithm for solving linear multiplicative programming
A branch-and-bound based method for solving monotone optimization problems
Bicriteria and restricted 2-facility Weber problems
Bicriteria network flow problems: Continuous case
Robust portfolio optimization with a generalized expected utility model under ambiguity
Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems
C-programming and the minimization of pseudolinear and additive concave functions
Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh
Optimization over the efficient set: Four special cases
Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
Parametric solution to the joint system identification and optimization problem
A convex analysis approach for convex multiplicative programming
The structure of admissible points with respect to cone dominance
Multiobjective integer nonlinear fractional programming problem: a cutting plane approach
An objective space cut and bound algorithm for convex multiplicative programmes
A new look at fractional programming
On the complexity and approximability of budget-constrained minimum cost flows
Pareto optimal policies for harvesting with multiple objectives
An algorithm for bicriterion linear programming
Linear multiplicative programming
Bibliography in fractional programming
Parameter-free convex equivalent and dual programs of fractional programming problems
Admissible points of a convex polyhedron
Minimizing the sum of a convex function and the product of two affine functions over a convex set
Canonical d. c. programming techniques for solving a convex program with an additional constraint of multiplicative type
An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming
An interior penalty function method for the construction of efficient points in a multiple-criteria control problem
The biobjective undirected two-commodity minimum cost flow problem
System modeling and optimization under vector-valued criteria
Vector maximization with two objective functions
Problems and methods with multiple objective functions
Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
Multiple objective minimum cost flow problems: a review
An efficient algorithm for globally solving generalized linear multiplicative programming
Efficiency and time-cost-tradeoffs in transportation problems
A parametric successive underestimation method for convex multiplicative programming problems
The range of the efficient frontier in multiple objective linear programming
A parametric characterization and an \(\epsilon\)-approximation scheme for the minimization of a quasiconcave program
Approximating a linear multiplicative objective in watershed management optimization
Bicriteria linear fractional programming
Fractional programming: Applications and algorithms
Multiple objectives and non-separability in stochastic dynamic programming
Multiple objective programming with piecewise linear functions
A parametric approach to solving bicriterion shortest path problems
The set of all nondominated solutions in linear cases and a multicriteria simplex method
The biobjective minimum cost flow problem
Bicriterion integer linear fractional programs with parameters in the objective functions
Efficient approximate representation of bi-objective tradeoff sets
Partitioning multiple objective optimal solutions with applications in radiotherapy design
Algorithms for nonlinear integer bicriterion problems
Solving multiple-objective problems in the objective space
Branch-and-reduce algorithm for convex programs with additional multiplicative constraints
Decomposition principle for indefinite quadratic programe
A new branch-and-bound algorithm for generalized affine multiplicative programming
A note on bicriterion programming
Solving zero-one multiple objective programs through implicit enumeration
Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
General communication schemes for multiobjective decision making
An interactive method as an aid in solving multi-objective mathematical programming problems
On the characterization of Pareto-optimal solutions in bicriterion optimization
On the characterization of noninferior solutions of the vector optimization problem
C-programming: A nonlinear parametric optimization method
Global optimization for generalized linear multiplicative programming using convex relaxation

This page was built for publication: Solving Bicriterion Mathematical Programs

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