In this paper we describe how computer systems can provide planners with active planning support, when these planners are carrying out their daily planning activities. This means that computer systems actively participate in the planning process by automatically generating plans or partial...

The textbook Dantzig-Wolfe decomposition for the Capacitated Lot Sizing Problem (CLSP),as already proposed by Manne in 1958, has an important structural deficiency. Imposingintegrality constraints on the variables in the full blown master will not necessarily give theoptimal IP solution as only...

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...

In this technical note we give a short proof based on standard results in convex analysis of some important characterization results listed in Theorem 3 and 4 of [1]. Actually our result is slightly general since we do not specify the convex set X. For clarity we use the same notation for the...

In this paper we will show that the closely K-convexlike vector-valued functions with K Rm a nonempty convex cone and related classes of vector-valued functions discussed in the literature arise naturally within the theory of biconjugate functions applied to the Lagrangian perturbation scheme in...

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,...

Organizations exist to create value for their stakeholders that stakeholders cannot create through individual effort. Information systems exist to increase an organization s ability to create value using intellectual capital. A theoretical explanation of value might therefore be useful to...

The present paper proposes a new approach to solve generalized fractional programming problems through user interaction. Capitalizing on two alternatives, we review the Dinkelbach-type methods and set forth the main difficulty in applying these methods. In order to cope with this difficulty, we...

Although the possibility to combine column generation and Lagrangian relaxation has been known for quite some time, it has only recently been exploited in algorithms. In this paper, we discuss ways of combining these techniques. We focus on solving the LP relaxation of the Dantzig-Wolfe master...

We consider equilibrium constrained optimization problems, which have a general formulationthat encompasses well-known models such as mathematical programs with equilibrium constraints, bilevel programs, and generalized semi-infinite programming problems. Based on the celebrated K K M lemma, we...