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 ...
In this paper we develop systematically infeasible-interior-point methods of arbitrarily high order for solving horizontal linear complementarity problems that are sufficient in the sense of Cottle, ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback