Norm-based approximation in bicriteria programming

An algorithm to approximate the nondominated set of continuous and discrete bicriteria programs is proposed. The algorithm employs block norms to find an approximation and evaluate its quality. By automatically adapting to th e problem's structure and scaling, the approximation is constructed objecti vely without interaction with the decision maker. Mathematical and practica l examples are included.