### Refine

#### Document Type

- Article (1)
- Conference Proceeding (1)

#### Keywords

- CAD (1)
- Diskrete Optimierung (1)
- Ressourcenallokation (1)
- Standardisierung (1)

We consider the standardization problem (SP) which can be formulated as follows. It is known demand bi in each type i in {1, 2, ..., n} of items. Production of yi items of the ith type brings a profit fi (yi), where fi is a nondecreasing concave function for each i in {1, 2, ..., n}.It is necessary to satisfy the demand and to maximize the total profit provided that there exist >standardization possibilities< . These possibilities means that some types of items can be replaced by some another types. We introduce generalized standardization problem (GSP) in which titems demand is given as the set of admissible demand vectors. We show that GSP and SP are special cases of the resource allocation problem over a network polymatroid. Ibasing on this observation we propose a polynomial time solution algorithm for GSP and SP.

Review of Discrete Optimization Techniques for CAD Discrete optimization in the structure design Morphological method The alternative graph approach Convex discrete optimization without objective function Matroidal Decomposition in design Decomposition of layered matrices Discrete Optimization in Designing Packing problem Optimal arrangement of rectangles and shortest paths in L1-metrics Partition problems Discrete optimization in computational geometry and computer graphics Maxima of a point set on the plane Triangulation One of the main problems in computer graphics is removing hidden lines and surfaces