scientific article; zbMATH DE number 3932804

From MaRDI portal
Publication:3707773





[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.





Describes a project that uses

Uses Software






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)