In the present paper a bi-objective integer linear programming problem (BILP) is discussed. The main effort in this work is to effectively implement the ϵ-constraint method to produce a complete set ...

For example, investigations into the intrinsic complexity of analysing probabilistic programs have elucidated the hardness of determining termination properties and approximating expected values [1].