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
Generating Epsilon-Efficient Solutions in Multiobjective Programming
TL;DR: Scalarization approaches to purposely generating e-efficient solutions of multiobjective programs are investigated and a generic procedure for computing these solutions is proposed and illustrated with an example.
Journal ArticleDOI
Implementation of a user-friendly software package-a guided tour of trimap
TL;DR: The foundations of the method are described, the potentialities of the developed package for multicriteria linear programming educational purposes are explored and a detailed ''guided tour'' of the now available software package for the Macintosh was missing.
Journal ArticleDOI
A dual variant of Benson's outer approximation algorithm for multiple objective linear programming
TL;DR: In this article, a dual variant of Benson's outer approximation algorithm is proposed to solve multiobjective linear programs in objective space, and the dual provides a weight set decomposition.
Journal ArticleDOI
Use of Substitute Scalarizing Functions to Guide a Local Search Based Heuristic: The Case of moTSP
TL;DR: The experiments in this paper suggest that for the multiobjective traveling salesman problem (moTSP) instances considered, heuristic optimization of the Tchebycheff program gives better results when using a substitute scalarizing function instead of theTchebyCheff based one to guide the local search path.
Journal ArticleDOI
Convex Input and Output Projections of Nonconvex Production Possibility Sets
TL;DR: In this paper, the authors characterize the smallest production possibility set that contains a specified set of (input, output) combinations, and obtain a necessary and sufficient condition for the recursion to stop in one iteration.