No label defined (Q3798482)

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

      Statements

      0 references
      1987
      0 references
      d.c. programs
      0 references
      additional constraints of complementarity type
      0 references
      design centering
      0 references
      polyhedral structure
      0 references
      [For the entire collection see Zbl 0647.00009.] We present a modified version of \textit{H. Tuy}'s method [in: Fermat days 85: Mathematics for optimization, Toulouse/France 1985, North-Holland Math. Stud. 129, 273-303 (1986; Zbl 0623.65067)] for solving a class of global optimization problems called d.c. programs, i.e. programs in which the objective function is linear and the feasible set is the intersection of a closed convex set and the complement of an open convex set. This algorithm is then applied to a convex programming problem with additional constraints of complementarity type and to a design centering problem with polyhedral structure.
      0 references

      Identifiers