메뉴 건너뛰기




Volumn 29, Issue 4, 2001, Pages 163-170

An interactive interior point algorithm for multiobjective linear programming problems

Author keywords

Compromise solution; Interactive methods; Interior point methods; Multiobjective linear programming

Indexed keywords

ALGORITHMS; DECISION MAKING; FUNCTION EVALUATION; MULTIPROGRAMMING; OPTIMIZATION;

EID: 0035507793     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(01)00089-X     Document Type: Article
Times cited : (14)

References (15)
  • 2
    • 0006827925 scopus 로고
    • An interior multiobjective primal-dual linear programming algorithm using approximated gradients and sequential generation of anchor points
    • (1994) Optimization , vol.30 , pp. 137-150
    • Arbel, A.1
  • 3
    • 0028194411 scopus 로고
    • Anchoring points and cones opportunities in interior multiobjective linear programming
    • (1994) J. Oper. Res. Soc. , vol.45 , Issue.1 , pp. 83-96
    • Arbel, A.1
  • 6
    • 0041627725 scopus 로고    scopus 로고
    • Using approximate gradients in developing an interactive interior primal-dual multiobjective linear programming algorithm
    • (1996) Eur. J. Oper. Res. , vol.89 , pp. 202-211
    • Arbel, A.1    Oren, S.S.2
  • 9
    • 0026876871 scopus 로고
    • Path following methods for linear programming
    • (1992) SIAM Rev. , vol.34 , Issue.34 , pp. 167-224
    • Gonzaga, C.C.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.