An algorithm for approximating the set of non-dominated solutions of a bicriterial linear programming problem with a parameter in the objective coefficients

An algorithm for solving a bicriterial linear programming problem with a parameter in the objective functions coefficients is proposed. The solution is understood as determining a ‘sufficient’ set of basic non-dominated solutions. The decision maker can influence the procedure by interrupting the algorithm at an appropriate moment and by choosing the type of non-dominated solutions to be determined in the first place.