In these comments on the excellent survey by Dinh and Jeyakumar, we briefly discuss some recently developed topics and results on applications of extended Farkas’ lemma(s) and related qualification conditions to problems of variational analysis and optimization, which are not fully reflected...

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

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

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

Conjugate function theory is used to develop dual programs for nonseparable convex programs involving the square root function. This function arises naturally in finance when one measures the risk of a portfolio by its variance–covariance matrix, in stochastic programming under chance...

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

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