Interactive Method for Solving Multi-Objective Convex Programs
Yugoslav journal of operations research, Tome 1 (1991) no. 2, p. 159
Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
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.
Keywords:
multi-objective programming, convex programming, interactive algorithms, constraint qualifications, marginal value
@article{YJOR_1991_1_2_a4,
author = {Emina Kr\v{c}mar-No\v{z}i\'c},
title = {Interactive {Method} for {Solving} {Multi-Objective} {Convex} {Programs}},
journal = {Yugoslav journal of operations research},
pages = {159 },
year = {1991},
volume = {1},
number = {2},
language = {en},
url = {http://geodesic.mathdoc.fr/item/YJOR_1991_1_2_a4/}
}
Emina Krčmar-Nožić. Interactive Method for Solving Multi-Objective Convex Programs. Yugoslav journal of operations research, Tome 1 (1991) no. 2, p. 159 . http://geodesic.mathdoc.fr/item/YJOR_1991_1_2_a4/