메뉴 건너뛰기




Volumn 46, Issue 7-8, 2007, Pages 976-984

Interval judgments and Euclidean centers

Author keywords

Analytic Hierarchy Process; Euclidean centers; Interval judgments; Linear programming

Indexed keywords

ANALYTIC HIERARCHY PROCESS; CONSTRAINT THEORY; FUNCTION EVALUATION; PROBLEM SOLVING; VECTORS;

EID: 34548118217     PISSN: 08957177     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.mcm.2007.03.011     Document Type: Article
Times cited : (19)

References (13)
  • 2
    • 0000544458 scopus 로고
    • Axiomatic foundation of the analytic hierarchy process
    • Saaty T.L. Axiomatic foundation of the analytic hierarchy process. Management Science 32 7 (1986) 841-855
    • (1986) Management Science , vol.32 , Issue.7 , pp. 841-855
    • Saaty, T.L.1
  • 3
    • 34548118537 scopus 로고
    • Preference programming and preference simulation: Robustness issues in the AHP
    • Arbel A., and Vargas L.G. Preference programming and preference simulation: Robustness issues in the AHP. European Journal of Operational Research 69 (1993) 202-209
    • (1993) European Journal of Operational Research , vol.69 , pp. 202-209
    • Arbel, A.1    Vargas, L.G.2
  • 5
    • 0024901948 scopus 로고
    • Approximate articulation of preference and priority derivation
    • Arbel A. Approximate articulation of preference and priority derivation. European Journal of Operational Research 43 3 (1989) 317-326
    • (1989) European Journal of Operational Research , vol.43 , Issue.3 , pp. 317-326
    • Arbel, A.1
  • 6
    • 0002466949 scopus 로고
    • Resolution of mathematical programming with nonlinear constraints by the method of centers
    • Abadie J. (Ed), North-Holland
    • Huard P. Resolution of mathematical programming with nonlinear constraints by the method of centers. In: Abadie J. (Ed). Nonlinear Programming (1967), North-Holland 209-219
    • (1967) Nonlinear Programming , pp. 209-219
    • Huard, P.1
  • 7
    • 34548127181 scopus 로고    scopus 로고
    • G. Sonnevend, An analytical center for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming, in: 12th IFIP Conference on Systems Modelling, Budapest, 1985
  • 8
    • 51249181779 scopus 로고
    • A new polynomial time algorithm for linear programming
    • Karmarkar N.K. A new polynomial time algorithm for linear programming. Combinatorica 4 (1984) 373-395
    • (1984) Combinatorica , vol.4 , pp. 373-395
    • Karmarkar, N.K.1
  • 9
    • 20744441002 scopus 로고
    • Algorithmic enhancements to the method of centers for linear programming problems
    • Boggs P.T., Domich P.D., Donaldson J.R., and Witzgall C. Algorithmic enhancements to the method of centers for linear programming problems. ORSA Journal on Computing 1 3 (1989) 159-171
    • (1989) ORSA Journal on Computing , vol.1 , Issue.3 , pp. 159-171
    • Boggs, P.T.1    Domich, P.D.2    Donaldson, J.R.3    Witzgall, C.4
  • 13
    • 34548125159 scopus 로고    scopus 로고
    • R. Sadka, Theory of centers and its use in multiobjective linear programming, M.Sc. Thesis, 1998, Tel Aviv University


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