No label defined (Q3695018)

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 3920223
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3920223

      Statements

      0 references
      0 references
      1985
      0 references
      vector optimization
      0 references
      locally effective points
      0 references
      compromise solutions
      0 references
      interactive algorithm
      0 references
      parametric optimization
      0 references
      [For the entire collection see Zbl 0571.00016.] The vector optimization problem is treated on the basis of applying the conceptions of effective points and, in the case of nonlinear problems, of locally effective points, the set of which is called \(M_{eff}\) \((M_{loc eff})\). Accordingly, the problem consists in (i) finding efficient methods for selecting points of \(M_{eff}\) \((M_{loc eff})\) which can be considered as compromise solutions satisfying the user's conditions, and (ii) constructing an interactive algorithm for restricting the set \(M_{eff}\) \((M_{loc eff})\) on the basis of (i) in an effective way. It is shown that for solving these problems parametric optimization is very useful. The approach finds effective points after each simplex iteration step for linear problems, and utilizes the good convergence properties of locally convergent algorithms in the case of nonlinear problems. All steps of the interactive algorithm are described. The implementation is done for the linear case on the ES-1022 computer of the Computer Center of the Humboldt University of Berlin, the dialogue program itself is written in Assembler and the optimization algorithm in FORTRAN language.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references