scientific article; zbMATH DE number 1302171
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].
- Connections between continuous and combinatorial optimization problems through an extension of the fundamental theorem of Linear Programming
- scientific article; zbMATH DE number 1383429
- scientific article; zbMATH DE number 1795208
- Exact penalty functions for nonlinear integer programming problems
- On the equivalence between some discrete and continuous optimization problems
- Improved penalty algorithm for mixed integer PDE constrained optimization problems
- On the equivalence between some discrete and continuous optimization problems
- Conic relaxations for semi-supervised support vector machines
- Connections between continuous and combinatorial optimization problems through an extension of the fundamental theorem of Linear Programming
- scientific article; zbMATH DE number 1186901 (Why is no real title available?)
- Disnel: An application package for solving discrete and nonlinear optimization problems
- Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition
- Continuous reformulations for zero-one programming problems
- scientific article; zbMATH DE number 1985655 (Why is no real title available?)
- A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems
- Analysis of penalty parameters in binary constrained extremum problems
- On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope
- In memoriam: Franco Giannessi (1935--2025)
- Exact approaches for convex adjustable robust optimization
- Existence and sum decomposition of vertex polyhedral convex envelopes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4247438)