This is a preview. Log in through your library . Abstract This paper presents an algorithm, based on the simplex routine, that provides a way to solve a problem in which the objective function is not ...

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

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

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

Simple solution of a linear program is often not enough. A manager needs to evaluate how sensitive the solution is to changing assumptions. The LP procedure provides several tools that are useful for ...