In this paper, we consider of a convexifiable programming problem with bounds on variables. We obtain Mond-Weir type duality theorems for the convexifiable programming problems. Moreover, we give a numerical example to illustrate our duality.

http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
https://www.riss.kr/link?id=A100776995
2008
English
KCI등재
학술저널
1257-1261(5쪽)
0
상세조회0
다운로드다국어 초록 (Multilingual Abstract)
In this paper, we consider of a convexifiable programming problem with bounds on variables. We obtain Mond-Weir type duality theorems for the convexifiable programming problems. Moreover, we give a numerical example to illustrate our duality.
In this paper, we consider of a convexifiable programming problem with bounds on variables. We obtain Mond-Weir type duality theorems for the convexifiable programming problems. Moreover, we give a numerical example to illustrate our duality.
CONDENSED CRAMER RULE FOR COMPUTING A KIND OF RESTRICTED MATRIX EQUATION
APPROXIMATE ANALYSIS OF AN N-DESIGN CALL CENTER WITH TWO TYPES OF AGENTS
A DIFFERENTIAL EQUATION WITH DELAY FROM BIOLOGY
INTUITIONISTIC FUZZINESS OF STRONG HYPER K-IDEALS AND HYPER K-SUBALGEBRAS