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