Interactive method for solving multi-objective convex programs

Interactive method for solving multi-objective convex programs

0.00 Avg rating0 Votes
Article ID: iaor19932411
Country: Serbia
Volume: 1
Start Page Number: 159
End Page Number: 170
Publication Date: Apr 1991
Journal: Yugoslav Journal of Operations Research
Authors:
Keywords: programming: convex
Abstract:

In this paper an interactive procedure for solving multi-objective programming problem has been developed. Algorithm for the convex case is based on some elements of the theory of convex programming irrespective of any constraint qualification. Sensitivity analysis of the convex program by marginal value formula from the input optimization provides necessary information to help the user in the dialog part of the procedure.

Reviews

Required fields are marked *. Your email address will not be published.