Weakly efficient solutions of limiting multicriteria optimization problems (Q4026475)

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 124848
Language Label Description Also known as
default for all languages
No label defined
    English
    Weakly efficient solutions of limiting multicriteria optimization problems
    scientific article; zbMATH DE number 124848

      Statements

      0 references
      0 references
      21 February 1993
      0 references
      second order stochastic matrix
      0 references
      bicriterion problems
      0 references
      weakly efficient points
      0 references
      Weakly efficient solutions of limiting multicriteria optimization problems (English)
      0 references
      [For the entire collection see Zbl 0745.00044.] Let \(A\) be a second order stochastic matrix of the type \(\left({a\atop 1- b} {1-a\atop b}\right)\), \(0<a<1\), \(0<b<1\), then the series of bicriterion problems \(A^ kf(x)\to\min\), \(x\in X\), \(X\subset R^ 2\) convex and compact, is studied for \(k\to\infty\), where min means, that weakly efficient points of \(X\) should be determined. Using the matrix \(A^*=\lim A^ k\), where \(A^*\) is the second order accompanying matrix corresponding to the eigenvalue 1 of \(A\) it is shown that the infinite intersection of the compact weakly efficient solution sets \(S_ k\) (relative to \(A^ kf\to\min)\) coincides with the set of the bicriterion problem \(A^*f\to\min\). A simple example is added.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references