This work aims to establish an algorithm for solving the problem of convex programming with several objective-functions with linear constraints. Starting from the idea of Rosen's algorithm for solving the problem of convex programming with lin...
http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
https://www.riss.kr/link?id=A100593031
1999
English
KCI등재
학술저널
79-88(10쪽)
0
상세조회0
다운로드다국어 초록 (Multilingual Abstract)
This work aims to establish an algorithm for solving the problem of convex programming with several objective-functions with linear constraints. Starting from the idea of Rosen's algorithm for solving the problem of convex programming with lin...
This work aims to establish an algorithm for solving the problem of convex programming with several objective-functions with linear constraints. Starting from the idea of Rosen's algorithm for solving the problem of convex programming with linear con-straints and taking into account the solution concept from multi-dimensional programming represented by a program which reaches "the best compromise" we are extending this method in the case of multidimensional programming. The concept of direction of min-imization is introduced and a necessary and sufficient condition is given for a s∈Rn direction to be a direction is min-imal. The two numerical examples presented at the end validate the algorithm.
BIOECONOMIC HARVESTING OF A SCHOOLING FISH SPECIES:A DYNAMIC REACTION MODEL
FREDHOLM-VOLTERRA INTEGRAL EQUATION WITH SINGULAR KERNEL