A comparison of two reference point methods in multiple objective mathematical programming.

DOI10.1016/S0377-2217(02)00487-3zbMath1035.90078OpenAlexW2012577280MaRDI QIDQ1811142

Yanyan Li

Publication date: 10 June 2003

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00487-3

zbMATH Keywords

Decision analysisMultiple objective programming

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Management decision making, including multiple objectives (90B50)

Related Items (12)

A multi-objective approach with soft constraints for water supply and wastewater coverage improvements ⋮ The ``weak-link approach to network DEA for two-stage processes ⋮ A conic scalarization method in multi-objective optimization ⋮ On the quality of discrete representations in multiple objective programming ⋮ Experiments with classification-based scalarizing functions in interactive multiobjective optimization ⋮ Reformulation of network data envelopment analysis models using a common modelling framework ⋮ A two-slope achievement scalarizing function for interactive multiobjective optimization ⋮ Targeting solutions in Bayesian multi-objective optimization: sequential and batch versions ⋮ A comparison of two reference point methods in multiple objective mathematical programming. ⋮ MOAQ and ant-Q algorithm for multiple objective optimization problems ⋮ Synchronous approach in interactive multiobjective optimization ⋮ Approximation methods in multiobjective programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the completeness and constructiveness of parametric characterizations to vector optimization problems
• Capturing decision maker preference: Experimental comparison of decision analysis and MCDM techniques
• An experimental evaluation of the efficacy of four multi-objective linear programming algorithms
• A new approach for multiple objective decision making
• TOPSIS for MODM
• A comparison of two reference point methods in multiple objective mathematical programming.
• Some experiments in Tchebycheff-based approaches for interactive multiple objective decision making
• The Framing of Decisions and the Psychology of Choice
• An Interactive Multiple Objective Linear Programming Method for a Class of Underlying Nonlinear Utility Functions
• A pareto race
• Linear max-min programming
• A Bi-Reference Procedure for Interactive Multiple Criteria Programming
• A Combined Tchebycheff/Aspiration Criterion Vector Interactive Multiobjective Programming Procedure
• A naïve approach for solving MCDM problems: the GUESS method
• An interactive weighted Tchebycheff procedure for multiple objective programming
• Application of Programs with Maximin Objective Functions to Problems of Optimal Resource Allocation
• Experimental consideration of preference in decision making under certainty
• Linear programming with multiple objective functions: Step method (stem)

This page was built for publication: A comparison of two reference point methods in multiple objective mathematical programming.