This note replies to comments raised by Professor Ogryczak regarding properties of the minmax goal programming and compromise programming solutions. It is shown how the two counterexamples used by Ogryczak to support his views have little validity because they are out of context. (C) 2001 Elsevier Science B.V. All rights reserved.