In this paper we deal with sensitivity analysis in convex quadratic programming, without making assumptions on nondegeneracy, strict convexity of the objective function, and the existence of a strictly complementary solution. We show that the optimal value as a function of a right--hand side...

Many common statistical models can be specified as linear models with restrictions imposed on the parameters. A large amount of these models impose restrictions which do not allow for the analytical construction of the probability density function (pdf) of the parameters given the restrictions....

We formulate the Forest Management Problem as a Multicommodity Network Flow Problem with a convex cost function. We then show how to transfer the problem to an equivalent Single-Commodity Network Flow formulation in order to address several sensitivity analysis questions using results by Granot...

We discuss in this paper some inventory-production models which can be formulated as nonlinear parametric network flow problems with one additional linear constraint. Several sensitivity analysis questions are addressed. The qualitative sensitivity results obtained provide the manager with...