Determining the optimal solution (OS) set of interval linear fractional programming (ILFP) models is generally an NP-hard problem. Few methods have been proposed in this field which have only been ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback