This paper studies a bicriteriainteger nonlinear fractional programming problem. An integer nonlinear fractional programming problem with one of the objective functions as the principal objective is considered. An in...
详细信息
This paper studies a bicriteriainteger nonlinear fractional programming problem. An integer nonlinear fractional programming problem with one of the objective functions as the principal objective is considered. An integer linear fractional programming problem related to this is constructed. By varying the minimum acceptable values of the second level objective a sequence of the constrained integer nonlinear fractional programming problems is solved to generate the exhaustive set of efficient solutions. Ranking of integer solutions of the linear fractional programming problem helps in finding the optimal integer solutions of the sequence of constrained nonlinear fractional programming problems.
A problem in multiobjective programming is to determine all efficient solutions. As a first approach we present a basic algorithm where only one of the objective functions is minimized and the second objective functio...
详细信息
A problem in multiobjective programming is to determine all efficient solutions. As a first approach we present a basic algorithm where only one of the objective functions is minimized and the second objective function is taken as a restriction. In the next algorithm the maximum of both objective functions is minimized. In the third algorithm this minimax function is replaced by a continuous quadratic objective function.
暂无评论