No label defined (Q4247438)

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

      Statements

      0 references
      0 references
      16 June 1999
      0 references
      survey
      0 references
      Although this is not an exhaustive survey of all connections between discrete optimization and nonlinear programming many interesting results are discussed. At first a general result on the equivalence between minimizing a function on a set and the problem of minimizing a penalized function on a larger set is given. This result is then used to reformulate integer programs as concave programs or as linear complementarity problems. Further the problem of establishing conditions under which a function achieves its minimum on the vertices of a polyhedron is discussed. In the next section it is proved that piecewise concave functions achieve their minimum on a set of points that is often finite. Then location problems are discussed and a generalization of bilinear programming problems are considered. Extension and relaxion of a function from a discrete set to a larger continuous set are discussed together with the opposite approach of discretizing a function defined on a polyhedron. Finally, some connections between global optimality conditions for continuous and discrete problems are given. For the entire collection see [Zbl 0903.90001].
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references