I: Optimization Theory -- A method for linearly constrained minimization problems -- On a class of nonconvex optimization problems -- Lower semicontinuity of marginal functions -- A new approach to symmetric quasiconvex conjugacy -- Generalized convexity, functional hulls and applications to...

On Using the Linear Programming Relaxation of Assignment Type Mixed Integer Problems -- Contributions to Duality Theory of Certain Non-Convex Optimization Problems -- Multistate Reliability Problems for GSP-Digraphs -- Improved Bounds for the Sn /n Problem -- Selection of Solutions by Algorithms...

This volume contains selected papers presented either at the Oberwolfach Conference on Operations Research, February 1987, or at the three-day workshop on Advanced Computation Techniques, Parallel Processing and Optimization organized by IIASA and the University of Karlsruhe, which immediately...

A cephoid is a Minkowski sum of finitely many prisms in R^n. We discuss the concept of duality for cephoids. Also, we show that the reference number uniquely defines a face. Based on these results, we exhibit two graphs on the outer surface of a cephoid. The first one corresponds to a maximal...

We discuss the structure of those polytopes in /R/n+ that are Minkowski sums of prisms. A prism is the convex hull of the origin and "n" positive multiples of the unit vectors. We characterize the defining outer surface of such polytopes by describing the shape of all maximal faces. As this...