Open AccessBook
Multiple Criteria Optimization: Theory, Computation, and Application
Reads0
Chats0
TLDR
Mathematical Background Topics from Linear Algebra Single Objective Linear Programming Determining all Alternative Optima Comments about Objective Row Parametric Programming Utility Functions, Nondominated Criterion Vectors and Efficient Points Point Estimate Weighted-sums Approach.Abstract:
Mathematical Background Topics from Linear Algebra Single Objective Linear Programming Determining all Alternative Optima Comments about Objective Row Parametric Programming Utility Functions, Nondominated Criterion Vectors and Efficient Points Point Estimate Weighted-sums Approach Optimal Weighting Vectors, Scaling and Reduced Feasible Region Methods Vector-Maximum Algorithms Goal Programming Filtering and Set Discretization Multiple Objective Linear Fractional Programming Interactive Procedures Interactive Weighted Tchebycheff Procedure Tchebycheff/Weighted-Sums Implementation Applications Future Directions Index.read more
Citations
More filters
Journal ArticleDOI
A goal programming procedure for solving problems with multiple fuzzy goals using dynamic programming
TL;DR: This paper describes how the preemptive priority based goal programming (GP) can be used to solve a class of fuzzy programming (FP) problems with the characteristics of dynamic programming (DP).
Journal ArticleDOI
Solving Multiple Objective Programming Problems Using Feed-Forward Artificial Neural Networks: The Interactive FFANN Procedure
TL;DR: Computational results indicate that the Interactive FFANN Procedure produces good solutions and is robust with regard to the neural network architecture.
Journal ArticleDOI
Multi-criteria analysis with partial information about the weighting coefficients
TL;DR: In this article, the authors address the problem of ranking a set of alternatives with partial information about the weighting coefficients and introduce a family of quasiorders that are easily interpretable and manageable, which includes among others, the natural quasiorder in R n and other well known preference structures in the literature.
A Dual Variant of Benson's Outer Approximation Algorithm
TL;DR: This paper employs results from geometric duality theory for multiple objective linear programmes to derive a dual variant of Benson's “outer approximation algorithm” to solve multiobjective linear programmes in objective space and proves that solving the dual provides a weight set decomposition.