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 ...
This is a preview. Log in through your library . Abstract The basic properties are stated of a linear programming problem with a linear objective function having quadratic constraints whose associated ...
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 ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback