Unconstrained 0-1 nonlinear programming: A nondifferentiable approach (Q1187840): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Philippe Yves Paul Michelon / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Joachim Piehler / rank | |||
Normal rank | |||
Revision as of 00:56, 20 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Unconstrained 0-1 nonlinear programming: A nondifferentiable approach |
scientific article |
Statements
Unconstrained 0-1 nonlinear programming: A nondifferentiable approach (English)
0 references
23 July 1992
0 references
The unconstrained 0-1 nonlinear programming problem is reduced to a nonlinear continuous problem where the objective function is piecewise linear. In the first formulation the objective function is the difference of two convex functions. In the other two formulations one gets concave problems having fewer integer local minima than by reduction in a classical way.
0 references
unconstrained 0-1 nonlinear programming
0 references
