scientific article; zbMATH DE number 3932804
[For the entire collection see Zbl 0541.00014.] The interactive weighted Tchebycheff algorithm for solving a multiple objective linear programming, \(_{x\in S}\) \(\{f_ i(x)=z_ i\), \(i=1,2,...,k\}\) is restated briefly in the paper, followed by a discussion of some pertinent points to the effective implementation of the algorithm. These points are: criterion value ranges over the efficient set to adapt the decision-maker's aspirations to the confines of his feasible region; early fixation on the selection of a given criterion vector as solution; number of solutions presented at each iteration for faster convergence of the algorithm; scaling the objectives; most preferred criterion vector as filtering seed point; insertion of criterion value lower bounds and resetting \(\epsilon_ i\) values in step 1 of the algorithm for integer and nonlinear programming cases.
- scientific article; zbMATH DE number 4112406
- Some experiments in Tchebycheff-based approaches for interactive multiple objective decision making
- An interactive combined branch-and-bound/Tchebycheff algorithm for multiple criteria optimization
- A Combined Tchebycheff/Aspiration Criterion Vector Interactive Multiobjective Programming Procedure
- A CHIM-based interactive Tchebycheff procedure for multiple objective decision making
- A modified weighted Tchebycheff metric for multiple objective programming
- Augmented Lagrangian and Tchebycheff approaches in multiple objective programming
- Interactive multiple objective programming using Tchebycheff programs and artificial neural networks
- Tchebycheff norms in multi-objective linear programming
- Modified interactive Chebyshev algorithm (MICA) for convex multiobjective programming
- A CHIM-based interactive Tchebycheff procedure for multiple objective decision making
- Warm-start routines for solving augmented weighted Tchebycheff network programs in multiple-objective network programming
- Quantitative comparison of approximate solution sets for multicriteria optimization problems with weighted Tchebycheff preference function
- An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems
- scientific article; zbMATH DE number 4147876 (Why is no real title available?)
- scientific article; zbMATH DE number 3980926 (Why is no real title available?)
- scientific article; zbMATH DE number 4112406 (Why is no real title available?)
- An interactive combined branch-and-bound/Tchebycheff algorithm for multiple criteria optimization
- A Combined Tchebycheff/Aspiration Criterion Vector Interactive Multiobjective Programming Procedure
- Implementing the Tchebycheff method in a spreadsheet
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3707773)