Linear goal programming (GP) is a widely used tool for dealing with problems involving multiple objectives. This paper aims to develope a new concept of duality for GP. In this concept the dual to a minsum GP problem is a GP problem and the dual to a lexicographic GP problem is a multidimensional lexicographic GP problem. We prove most of the typical dual relations including the saddle-point property and the formula for marginal values.