Showing 1 - 10 of 58
We consider nonlinear stochastic optimization problems with probabilistic constraints. The concept of a p-efficient point of a probability distribution is used to derive equivalent problem formulations, and necessary and sufficient optimality conditions. We analyze the dual functional and its...
Persistent link: https://www.econbiz.de/10010999538
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...
Persistent link: https://www.econbiz.de/10010998256
We consider nonlinear stochastic optimization problems with probabilistic constraints. The concept of a p-efficient point of a probability distribution is used to derive equivalent problem formulations, and necessary and sufficient optimality conditions. We analyze the dual functional and its...
Persistent link: https://www.econbiz.de/10010759130
Persistent link: https://www.econbiz.de/10011812858
Persistent link: https://www.econbiz.de/10012495252
We introduce a chance constrained optimization model for the fulfillment of guaranteed display Internet advertising campaigns. The proposed formulation for the allocation of display inventory takes into account the uncertainty of the supply of Internet viewers. We discuss and present theoretical...
Persistent link: https://www.econbiz.de/10011209177
For an optimization problem with a composed objective function and composed constraint functions we determine, by means of the conjugacy approach based on the perturbation theory, some dual problems to it. The relations between the optimal objective values of these duals are studied. Moreover,...
Persistent link: https://www.econbiz.de/10010847933
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...
Persistent link: https://www.econbiz.de/10011052501
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...
Persistent link: https://www.econbiz.de/10011052650
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...
Persistent link: https://www.econbiz.de/10011052685