This paper presents three algorithms for solving linear programming problems in which some or all of the objective function coefficients are specified in terms of intervals. Which algorithm is ...

A routine written in IML to solve this problem follows. The approach appends slack, surplus, and artificial variables to the model where needed. It then solves phase 1 to find a primal feasible ...

In linear programming, the objective function is the function that it is desired to maximize or minimize. The human interaction equivalent is what matters most. Agreement on that, and on the steps to ...

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