We show that the simplex method can be interpreted as a cutting-plane method, assuming that a special pricing rule is used. This approach is motivated by the recent success of the cutting-plane method in the solution of special stochastic programming problems. We focus on the special linear...

We propose and analyze an effective model for the Multistage Multiproduct Advertising Budgeting problem. This model optimizes the advertising investment for several products, by considering cross elasticities, different sales drivers and the whole planning horizon. We derive a simple procedure...

Drei große Reformenpakete und eine Reihe kleinerer Begleitmaßnahmen prägen das renten¬politische Erbe der rot-grünen Bundesregierung. Einerseits greifen sie Trends in der Reformpolitik seit Beginn der 90er Jahre auf. So verstärkt die Rentenstrukturreform 2001 beispielsweise die...

We propose a framework to generate alternative mixed-integer nonlinear programming formulations for disjunctive convex programs that lead to stronger relaxations. We extend the concept of “basic steps” defined for disjunctive linear programs to the nonlinear case. A basic step is an...

A natural way to handle optimization problem with data affected by stochastic uncertainty is to pass to a chance constrained version of the problem, where candidate solutions should satisfy the randomly perturbed constraints with probability at least 1−ϵ. While being attractive from modeling...

Estimating the probabilities by which different events might occur is usually a delicate task, subject to many sources of inaccuracies. Moreover, these probabilities can change over time, leading to a very difficult evaluation of the risk induced by any particular decision. Given a set of...

In this paper, we consider a class of convex nonlinear knapsack problems in which all decision variables are integer and the objective and knapsack functions are nonlinear. This generalized problem is characterized by positive marginal cost (PMC) and increasing marginal loss-cost ratio (IMLCR)....

This paper considers a multi-product newsvendor problem with multiple constraints. Multiple constraints in the problem make it more challenging to solve. Previous research has attempted to solve the problem by considering two-constraint case or/and using approximation techniques or active sets...