No label defined (Q3707773)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3932804
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3932804

      Statements

      0 references
      1984
      0 references
      interactive weighted Tchebycheff algorithm
      0 references
      multiple objective linear programming
      0 references
      criterion value
      0 references
      [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.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references