Connectedness of efficient solutions in multiple criteria combinatorial optimization

The topological connectedness of the set of efficient solutions to multiple criteria optimization problems defined using a linear programming formulation was investigated. Specifically, computational experiments were carried out to show an exemption to the connectedness of efficient solutions to the shortest path problem and to prove the non-connectedness of the spanning tree problem.