This paper discusses necessary optimality conditions for multi-objective optimization problems with application to the Second Theorem of Welfare Economics. We use the extremal principle, since we consider non-convex sets non-smooth functions. Particularly, we develop a slight generalization of...

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

High-dimensional feature selection has become increasingly crucial for seeking parsimonious models in estimation. For selection consistency, we derive one necessary and sufficient condition formulated on the notion of degree of separation. The minimal degree of separation is necessary for any...

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

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

In this paper, we consider convex optimization problems with cone constraints (CPC in short). We study generalized weak sharp minima properties for (CPC) in the Banach space and Hilbert space settings, respectively. Some criteria and characterizations for the solution set to be 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...

The generalized Nash equilibrium problem (GNEP) is a noncooperative game in which the strategy set of each player, as well as his payoff function, depend on the rival players strategies. As a generalization of the standard Nash equilibrium problem (NEP), the GNEP has recently drawn much...

The Equalization method for the Stochastic Generalized Transportation Problem is presented. The algorithm allows to find the optimal solution to the problem of minimizing the expected total cost in the Generalized Transportation Problem with random demand. It is shown that the method is...