메뉴 건너뛰기




Volumn 89, Issue 1, 1996, Pages 202-211

Using approximate gradients in developing an interactive interior primal-dual multiobjective linear programming algorithm

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DECISION MAKING; ITERATIVE METHODS; LINEAR PROGRAMMING;

EID: 0041627725     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(94)00225-8     Document Type: Article
Times cited : (9)

References (12)
  • 1
    • 0006413712 scopus 로고
    • Exploring Interior-Point Linear Programming: Algorithms and Software
    • A. Arbel Exploring Interior-Point Linear Programming: Algorithms and Software 1993 MIT Press, Cambridge, MA
    • (1993)
    • Arbel, A.1
  • 2
    • 0027657122 scopus 로고
    • An interior multiobjective linear programming algorithm
    • A. Arbel An interior multiobjective linear programming algorithm Computers & Operations Research 20/7 1993 723 735
    • (1993) Computers & Operations Research , vol.20/7 , pp. 723-735
    • Arbel, A.1
  • 3
    • 0028194411 scopus 로고
    • Anchoring points and cones of opportunities in interior multiobjective linear programming problems
    • A. Arbel Anchoring points and cones of opportunities in interior multiobjective linear programming problems Journal of the Operational Research Society 45/1 1994 83 96
    • (1994) Journal of the Operational Research Society , vol.45/1 , pp. 83-96
    • Arbel, A.1
  • 4
    • 0003608879 scopus 로고
    • Multiobjectiue Decision Making: Theory and Methodology
    • V. Chankong Y.Y. Haimes Multiobjectiue Decision Making: Theory and Methodology 1983 North-Holland Amsterdam
    • (1983)
    • Chankong, V.1    Haimes, Y.Y.2
  • 5
    • 51249181779 scopus 로고
    • A new polynomial time algorithm for linear programming
    • N.K. Karmarkar A new polynomial time algorithm for linear programming Combinatorica 4 1984 373 395
    • (1984) Combinatorica , vol.4 , pp. 373-395
    • Karmarkar, N.K.1
  • 6
    • 0002781299 scopus 로고
    • A primal-dual interior point algorithm for linear programming
    • M. Kojima S. Mizuno A. Yoshise A primal-dual interior point algorithm for linear programming N. Megiddo Progress in Mathematical Programming, Interior-Point and Related Methods 1989 Springer-Verlag Berlin 29 48
    • (1989) , pp. 29-48
    • Kojima, M.1    Mizuno, S.2    Yoshise, A.3
  • 7
    • 0002431411 scopus 로고
    • An implementation of a primal-dual interior point method for linear programming
    • K.A. McShane C.L. Monma D.F. Shanno An implementation of a primal-dual interior point method for linear programming ORSA Journal on Computing 1 1989 70 83
    • (1989) ORSA Journal on Computing , vol.1 , pp. 70-83
    • McShane, K.A.1    Monma, C.L.2    Shanno, D.F.3
  • 8
    • 0002781299 scopus 로고
    • Progress in Mathematical Programming: Interior-Point and Related Methods
    • N. Megiddo Progress in Mathematical Programming: Interior-Point and Related Methods 1989 Springer-Verlag Berlin
    • (1989)
    • Megiddo, N.1
  • 9
    • 0003443506 scopus 로고
    • Multicriteria Decision Making: The Analytic Hierarchy Process
    • T.L. Saaty Multicriteria Decision Making: The Analytic Hierarchy Process 1988 RSW Publications Pittsburgh, PA
    • (1988)
    • Saaty, T.L.1
  • 10
    • 0003709653 scopus 로고
    • Multiple Criteria Optimization: Theory, Computation, and Application
    • R.E. Steuer Multiple Criteria Optimization: Theory, Computation, and Application 1986 Wiley New York
    • (1986)
    • Steuer, R.E.1
  • 11
    • 33746951751 scopus 로고
    • A modification of Karmarkar's linear programming algorithm
    • R.J. Vanderbei M.S. Meketon B.A. Freedman A modification of Karmarkar's linear programming algorithm Algorithmica 1 1986 395 407
    • (1986) Algorithmica , vol.1 , pp. 395-407
    • Vanderbei, R.J.1    Meketon, M.S.2    Freedman, B.A.3
  • 12
    • 0003770184 scopus 로고
    • Multiple Criteria Decision Making
    • M. Zeleny Multiple Criteria Decision Making 1982 McGrawHill New York
    • (1982)
    • Zeleny, M.1


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