Abstract
In this paper we combine the Tchebycheff method of Steuer and Choo with Wierzbicki's Aspiration Criterion Vector method in order to form an improved procedure for interactive multiple objective programming. The Combined procedure is sensible because the Tchebycheff and Aspiration Criterion Vector methods possess complementary distinguishing characteristics, solve similar optimization problems to probe the nondominated set, and share a similar computer/user interface. In the early iterations, Tchebycheff probes of the nondominated set might be conducted to locate promising neighborhoods of search. In later iterations, Aspiration Criterion Vector probes might be used to pinpoint a final solution. Computational experience is reported showing the improved effectiveness of the Combined Procedure when employed in this fashion when compared against the Tchebycheff and Aspiration Criterion Vector methods run separately.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
