In facility layout problems, a major concern is the optimal design or remodeling of the facilities of an organization. The decision maker's objective is to arrange the facility in an optimal way, so that the interaction among functions (i.e. machines, inventories, persons) and places (i.e....

This paper identifies the optimal options of Krabi's coastal land use to facilitate the final planning decision. Through compromise programming approach, the optimization models with respect to the weights assigned to two objectives of maximizing the net private and environmental benefits are...

In der Aussenhandelstheorie wird das Angebot und die Nachfrage mit Hilfe der Dualitaetstheorie abgebildet. Dabei wird auf nationaler Ebene das Problem der Erloesmaximierung untersucht, wobei die nationalen Faktorbestaende und die Produktionstechnologien der einzelnen Unternehmen gegeben sind....

Land use and crop production in the Khorezm region in western Uzbekistan, exemplarily for the irrigated low-lands of Central Asia, is adversely affected by the excessive, non-sustainable use of irrigation water on one hand, repeated droughts on the other hand, and by soil degradation by...

Contemporary financial stochastic programs typically involve a trade-offbetween return and (downside)-risk. Using stochastic programming we characterize analytically (rather than numerically) the optimal decisions that follow from characteristic single-stage and multi-stage versions of such...

In this paper we consider optimization problems defined by a quadraticobjective function and a finite number of quadratic inequality constraints.Given that the objective function is bounded over the feasible set, we presenta comprehensive study of the conditions under which the optimal solution...

In this paper we will describe a Multi-Agent System which iscapable of finding a feasible solution of a specially structuredlinear programming problem. Emphasis is given to correctnessissues and termination detection.

We present algorithms to calculate the stability radius of optimal or approximate solutions of binary programming problems with a min-sum or min-max objective function. Our algorithms run in polynomial time if the optimization problem itself is polynomially solvable. We also extend our results...