Showing 1 - 10 of 842
In the dual bin packing problem, the objective is to assign items of given size to the largest possible number of bins, subject to the constraint that the total size of the items assigned to any bin is at least equal to 1. We carry out a probabilistic analysis of this problem under the...
Persistent link: https://www.econbiz.de/10010837833
We present a new approximation algorithm for the two-dimensional bin-packing problem. The algorithm is based on two one-dimensional bin-packing algorithms. Since the algorithm is of next-fit type it can also be used for those cases where the output is required to be on-line (e. g. if we open an...
Persistent link: https://www.econbiz.de/10010837894
A probabilistic analysis is presented of the Next Fit Decreasing bin packing heuristic, in which bins are opened to accomodate the items in order of decreasing size.
Persistent link: https://www.econbiz.de/10010837960
In this note we give an elementary proof of the Fritz-John and Karush-Kuhn-Tucker conditions for nonlinear finite dimensional programming problems with equality and/or inequality constraints.The proof avoids the implicit function theorem usually applied when dealing with equality constraints and...
Persistent link: https://www.econbiz.de/10010731568
In this note we give a short and easy proof of the equivalence of Hakimi's one-median problem and the k-server-facility-loss median problem as discussed by Chiu and Larson in Computer and Operation Research. The proof makes only use of a stochastic monotonicity result for birth and death...
Persistent link: https://www.econbiz.de/10010731602
In this paper we analyse the optimal claim behaviour of a risk sensitive policy holder having a vehicle damage insurance. It is proved that the optimal decision is of the form: to claim for damages only if its amount exceeds a certain limit. Moreover, we also derive the optimal stopping rule to...
Persistent link: https://www.econbiz.de/10010731618
In this note we show that the strong duality theorem of an unconstrained (generalized) geometric programming problem as defined by Peterson (cf.[1]) is actually a special case of a Lagrangian duality result. Contrary to [1] we also consider the case that the set C is compact and convex and in...
Persistent link: https://www.econbiz.de/10010731624
Single-ratio and multi-ratio fractional programs in applications are often generalized convex programs. We begin with a survey of applications of single-ratio fractional programs, min-max fractional programs and sum-of-ratios fractional programs. Given the limited advances for the latter class...
Persistent link: https://www.econbiz.de/10010731635
Steel structures such as bridges, tanks and pylons are exposed to outdoor weathering conditions. In order to prevent them from corrosion they are protected by an organic coating system. Unfortunately, the coating system itself is also subject to deterioration. Imperfect maintenance actions such...
Persistent link: https://www.econbiz.de/10010731639
We present a thorough analysis of the economic order quantity model with shortages under a general inventory cost rate function and concave production costs. By using some standard results from convex analysis, we show that the model exhibits a composite concave-convex structure. Consequently,...
Persistent link: https://www.econbiz.de/10010731642