An Overview of Techniques for Solving Multiobjective Mathematical Programs

DOI10.1287/mnsc.30.11.1268zbMath0551.90090OpenAlexW2030406435MaRDI QIDQ3343799

Gerald W. Evans

Publication date: 1984

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.30.11.1268

zbMATH Keywords

surveyalgorithmsmultiple criteriamultiple objectivescontinuous decision variablesMultiobjective mathematical programming

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Management decision making, including multiple objectives (90B50) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (max. 100)

General communication schemes for multiobjective decision making ⋮ A class of practical interactive branch and bound algorithms for multicriteria integer programming ⋮ Estimating aspiration levels from discrete choices -- computational techniques and experiences ⋮ From closed-loop to sustainable supply chains: the WEEE case ⋮ Interactive bicriterion solution method and its application to critical path method problems ⋮ On \(q\)-steepest descent method for unconstrained multiobjective optimization problems ⋮ The double role of the weight factor in the goal programming model ⋮ Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic ⋮ Barzilai and Borwein's method for multiobjective optimization problems ⋮ A modified Quasi-Newton method for vector optimization problem ⋮ A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions ⋮ An interactive outranking system for multiattribute decision making ⋮ D-STEM: a modified step method with desirability function concept ⋮ 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 ⋮ Multiplicative programming problems: Analysis and efficient point search heuristic ⋮ A review of interactive methods for multiobjective integer and mixed-integer programming ⋮ Improving the min-max method for multiobjective programming ⋮ A non-interactive elicitation method for nonlinear multiattribute utility functions: theory and application to agricultural economics ⋮ Use of reference points for solving MONLP problems ⋮ An adaptive nonmonotone line search for multiobjective optimization problems ⋮ Strictly feasible solutions and strict complementarity in multiple objective linear optimization ⋮ Unnamed Item ⋮ Different Probability Distributions for Portfolio Selection in the Chance Constrained Compromise Programming Model ⋮ Multiobjective BFGS method for optimization on Riemannian manifolds ⋮ Multiobjective conjugate gradient methods on Riemannian manifolds ⋮ A Barzilai-Borwein descent method for multiobjective optimization problems ⋮ An interactive method for multiple-objective mathematical programming problems ⋮ Network reoptimization procedures for multiobjective network problems ⋮ The Pareto-optimal solution set of the equilibrium network design problem with multiple commensurate objectives ⋮ Finding a weights-restricted efficient (extreme) point and using it for solving MOLP problems. ⋮ An all-linear programming relaxation algorithm for optimizing over the efficient set ⋮ Using efficient feasible directions in interactive multiple objective linear programming ⋮ Complete efficiency and the initialization of algorithms for multiple objective programming ⋮ Parametric global optimisation for bilevel programming ⋮ An interactive multiobjective nonlinear programming procedure ⋮ A comparative study of interactive tradeoff cutting plane methods for MOMP ⋮ Two multiple criteria group decision support systems based on mathematical programming and ranking methods ⋮ An interactive multi-objective gradient search ⋮ An aspiration-level interactive model for multiple criteria decision making ⋮ A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case ⋮ A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems ⋮ A steepest descent method for vector optimization ⋮ Multicriteria scheduling problems: a survey ⋮ Feature issue: Multiobjective programming and goal programming ⋮ Goal programming model: A glorious history and a promising future ⋮ A new heuristic for the flowshop scheduling problem to minimize makespan and maximum tardiness ⋮ Optimally solving the generalized serial-lock scheduling problem from a graph-theory-based multi-commodity network perspective ⋮ An interactive multiobjective programming approach to combinatorial data analysis ⋮ Decision-maker's preferences modelling within the goal-programming model: a new typology ⋮ Searching for psychologically stable solutions of multiple criteria decision problems ⋮ Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems ⋮ Multicriteria analysis using a large-scale energy supply LP model ⋮ Further analysis of an outcome set-based algorithm for multiple-objective linear programming ⋮ Hybrid approach for solving multiple-objective linear programs in outcome space ⋮ Interactive multiple objective optimization: Survey. I: Continuous case ⋮ Model choice in multicriteria decision aid ⋮ Multi-objective optimization over convex disjunctive feasible sets using reference points ⋮ The interface between OR/MS and decision theory ⋮ Algorithms for solving the mixed integer two-level linear programming problem ⋮ Interactive multiobjective agro-ecological land use planning: the Bungoma region in Kenya ⋮ A Lower Bound of the Choquet Integral Integrated Within Martins’ Algorithm ⋮ An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound ⋮ An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming ⋮ Outcome space partition of the weight set in multiobjective linear programming ⋮ Multicriteria scheduling ⋮ A branch and bound algorithm for mixed zero-one multiple objective linear programming ⋮ User acceptance of multi-criteria decision support systems: the impact of preference elicitation techniques ⋮ Using DEA to obtain efficient solutions for multi-objective 0--1 linear programs ⋮ Domestic petroleum-related expertise utilization and Nigeria's oil industry survival: A multicriteria decision analysis ⋮ A superlinearly convergent nonmonotone quasi-Newton method for unconstrained multiobjective optimization ⋮ New closedness results for efficient sets in multiple objective mathematical programming ⋮ An interactive procedure for multiple objective integer linear programming problems ⋮ Use of reference points of MOLP problems analysis ⋮ A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program ⋮ An improved multiple criteria visual interactive method with stepwise focused contouring of efficient criterion vectors ⋮ A neural network technique in modeling multiple criteria multiple person decision making ⋮ Extremist vs. centrist decision behavior: Quasi-convex utility functions for interactive multi-objective linear programming problems ⋮ A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set ⋮ Optimization over the efficient set: Four special cases ⋮ Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming ⋮ The compromise hypersphere for multiobjective linear programming ⋮ An algorithm for systems welfare interactive goal programming modelling ⋮ Analysis of multicriteria decision aid in Europe

This page was built for publication: An Overview of Techniques for Solving Multiobjective Mathematical Programs