Comments on properties of the minmax solutions in goal programming - A reply

Mehrdad Tamiz; Dylan Jones; Carlos Romero

doi:10.1016/S0377-2217(00)00090-4

Comments on properties of the minmax solutions in goal programming - A reply

Mehrdad Tamiz, Dylan Jones, Carlos Romero^*

^*Corresponding author for this work

School of Mathematics & Physics

Technical University of Madrid

Research output: Contribution to journal › Comment/debate › peer-review

Abstract

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.

Original language	English
Pages (from-to)	685-686
Number of pages	2
Journal	European Journal of Operational Research
Volume	131
Issue number	3
DOIs	https://doi.org/10.1016/S0377-2217(00)00090-4
Publication status	Published - 16 Jun 2001

Keywords

Efficiency
Equity
Goal programming

Access to Document

10.1016/S0377-2217(00)00090-4

Cite this

@article{b97d07146bd343949e05900fb1f006b4,

title = "Comments on properties of the minmax solutions in goal programming - A reply",

abstract = "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.",

keywords = "Efficiency, Equity, Goal programming",

author = "Mehrdad Tamiz and Dylan Jones and Carlos Romero",

year = "2001",

month = jun,

day = "16",

doi = "10.1016/S0377-2217(00)00090-4",

language = "English",

volume = "131",

pages = "685--686",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier BV",

number = "3",

}

TY - JOUR

T1 - Comments on properties of the minmax solutions in goal programming - A reply

AU - Tamiz, Mehrdad

AU - Jones, Dylan

AU - Romero, Carlos

PY - 2001/6/16

Y1 - 2001/6/16

N2 - 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.

AB - 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.

KW - Efficiency

KW - Equity

KW - Goal programming

UR - https://www.scopus.com/pages/publications/0035897972

UR - https://www.sciencedirect.com/journal/european-journal-of-operational-research/vol/131/issue/3

U2 - 10.1016/S0377-2217(00)00090-4

DO - 10.1016/S0377-2217(00)00090-4

M3 - Comment/debate

AN - SCOPUS:0035897972

SN - 0377-2217

VL - 131

SP - 685

EP - 686

JO - European Journal of Operational Research

JF - European Journal of Operational Research

IS - 3

ER -

Comments on properties of the minmax solutions in goal programming - A reply

Abstract

Keywords

Access to Document

Fingerprint

Cite this