It has previously been shown that nine of the most prominent procedures of interactive multiple objective programming can be considered as special cases of a common procedure called the unified algorithm. In this paper, we show how four additional procedures can be similarly included in the unified approach. Also, the paper presents a procedure-switching matrix that depicts the possibilities for switching from one procedure to another, one iteration to the next, in the unified algorithm if so directed by a user.
No takes yet. Share an insight, caveat, or question.
Gardiner et al. (1994) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: