The inverse p-median problem with variable edge lengths on graphs is to modify the edge lengths at minimum total cost with respect to given modification bounds such that a prespecified set of p vertices becomes a p-median with respect to the new edge lengths. The problem is shown to be strongly...

We consider an inverse quadratic programming (QP) problem in which the parameters in both the objective function and the constraint set of a given QP problem need to be adjusted as little as possible so that a known feasible solution becomes the optimal one. We formulate this problem as a linear...

We consider an inverse quadratic programming (QP) problem in which the parameters in both the objective function and the constraint set of a given QP problem need to be adjusted as little as possible so that a known feasible solution becomes the optimal one. We formulate this problem as a linear...

We propose a parameter estimation method based on what we call the minimum decisional regret principle. We focus on mathematical programming models with objective functions that depend linearly on costs or other parameters. The approach is illustrated for cost estimation in production planning...

This paper proposes a systematic approach to certain parameter estimation problems relevant to applied optimization models. A context-specific measure of decision maker performance called decisional efficiency is defined as a function of the unknown parameter vector. The values of this measure...