No label defined (Q3468894)
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 4135727
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4135727 |
Statements
1989
0 references
piecewise linear objective
0 references
conditional threshold constraints
0 references
solution by partitioning
0 references
non-smooth and non-convex mathematical programming
0 references
special structure
0 references
decomposition
0 references
0.7329305410385132
0 references
0.7215828895568848
0 references
0.71517413854599
0 references
[For the entire collection see Zbl 0678.00013.] The paper deals with the numerical solution of a class of non-smooth and non-convex mathematical programming problems with a special structure. The approach is that of decomposition by partitioning the feasible set into a finite number of ordinary linear programming problems. The paper was motivated by the modeling of the optimization of vintage declaration for French wine growers. This problem seeks to optimize the quantity of grapes allocated to various production types subject to restrictions on the use of the various types of inputs (grapes). The model is a specific case of the general program: \[ Maximize\quad f(x)=\sum^{N}_{j=1}c_ j(x)x_ j, \] subject to \(x\in C\); r(x)\(\geq 0\); for all \(j\in J\), \(r(x)>s_ j\) implies \(x_ j=0\); C is a closed, bounded, convex set and f(x) is a piecewise, linear possibly non- continuous function. The approach is to partition the feasible set into bounded convex polyhedra and to solve the resulting linear problem on this restricted set.
0 references