The Multisource Weber problem, also known as the continuous location-allocation problem, or as the Fermat-Weber problem, is considered here. A particular case of the Multisource Weber problem is the minimum sum-of-distances clustering problem, also known as the continuous <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$$p$$</EquationSource> <EquationSource Format="MATHML"> <math xmlns:xlink="http://www.w3.org/1999/xlink"> <mi>p</mi> </math> </EquationSource> </InlineEquation>-median...</equationsource></equationsource></inlineequation>

In this paper, we establish a strong duality theorem for a pair of Mond–Weir type second-order nondifferentiable symmetric dual problems. This removes certain inconsistencies in some of the earlier results.

A pair of Mond–Weir type nondifferentiable second-order symmetric primal and dual problems in mathematical programming is formulated. Weak duality, strong duality, and converse duality theorems are established under η-pseudobonvexity assumptions. Symmetric minimax mixed integer primal and...