메뉴 건너뛰기




Volumn 8, Issue 1, 1997, Pages 41-56

A Parallel Algorithm for Multiple Objective Linear Programs

Author keywords

ADBASE; Efficient solution; Multiple objective linear program; Parallel efficiency; Parallel speedup; Scalability

Indexed keywords

EFFICIENCY; JOB ANALYSIS; MULTIPROCESSING PROGRAMS; PARALLEL ALGORITHMS; PERFORMANCE; PROGRAM PROCESSORS;

EID: 0031192017     PISSN: 09266003     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008606530836     Document Type: Article
Times cited : (9)

References (22)
  • 1
    • 0002393742 scopus 로고
    • An all-linear programming relaxation algorithm for optimizing over the efficient set
    • H.P. Benson, "An all-linear programming relaxation algorithm for optimizing over the efficient set," Journal of Global Optimization, vol. 1, pp. 83-104, 1991.
    • (1991) Journal of Global Optimization , vol.1 , pp. 83-104
    • Benson, H.P.1
  • 2
    • 0026853797 scopus 로고
    • A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
    • _, "A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set," Journal of Optimization Theory and Applications, vol. 73, pp. 47-64, 1992.
    • (1992) Journal of Optimization Theory and Applications , vol.73 , pp. 47-64
  • 3
    • 0027543554 scopus 로고
    • A face search heuristic algorithm for optimizing over the efficient set
    • H.P. Benson and S. Sayin, "A face search heuristic algorithm for optimizing over the efficient set," Naval Research Logistics, vol. 40, pp. 103-116, 1993.
    • (1993) Naval Research Logistics , vol.40 , pp. 103-116
    • Benson, H.P.1    Sayin, S.2
  • 4
    • 2342542712 scopus 로고
    • Co-ordinated static and dynamic monitoring and optimization of power systems using a parallel architecture and pattern recognition techniques
    • C.S. Chang, "Co-ordinated static and dynamic monitoring and optimization of power systems using a parallel architecture and pattern recognition techniques," IEE Proceedings - C, vol. 139, pp. 197-204, 1992.
    • (1992) IEE Proceedings - C , vol.139 , pp. 197-204
    • Chang, C.S.1
  • 8
    • 0345270125 scopus 로고
    • Scalable load-balancing strategies for parallel A* algorithms
    • S. Dutt and N. Mahapatra, "Scalable load-balancing strategies for parallel A* algorithms," Journal of Parallel and Distr. Computing, vol. 22, pp. 488-505, 1994.
    • (1994) Journal of Parallel and Distr. Computing , vol.22 , pp. 488-505
    • Dutt, S.1    Mahapatra, N.2
  • 9
    • 2342532750 scopus 로고
    • Multicriteria optimization in the DISO system
    • A. Kurzhanski, K. Neumann, and D. Pallaschke (Eds.), Springer-Verlag: Berlin
    • Y. Evtushenko, V. Mazourik, and V. Ratkin, "Multicriteria optimization in the DISO system," Optimization, Parallel Proceesing and Application, A. Kurzhanski, K. Neumann, and D. Pallaschke (Eds.), Springer-Verlag: Berlin, pp. 94-102, 1988.
    • (1988) Optimization, Parallel Proceesing and Application , pp. 94-102
    • Evtushenko, Y.1    Mazourik, V.2    Ratkin, V.3
  • 11
    • 2342558929 scopus 로고
    • Parallel algorithms for discrete optimization problems
    • V. Kumar and G. Ananth, "Parallel algorithms for discrete optimization problems," Math. Programming Soc. Comm. Alg. Bul., vol. 21, pp. 8-12, 1992.
    • (1992) Math. Programming Soc. Comm. Alg. Bul. , vol.21 , pp. 8-12
    • Kumar, V.1    Ananth, G.2
  • 14
    • 2342614543 scopus 로고
    • Parallel implementation of selected MCDM algorithms
    • Paper presented, Chicago
    • A. Lewandowski, "Parallel implementation of selected MCDM algorithms," Paper presented at the TIMS/ORSA Joint National Meeting, Chicago, 1993.
    • (1993) TIMS/ORSA Joint National Meeting
    • Lewandowski, A.1
  • 15
    • 2342507446 scopus 로고    scopus 로고
    • Scalable Global and Local Hashing Strategies for Duplicate Pruning in Parallel A* Graph Search
    • to appear
    • N. Mahapatra and S. Dutt, Scalable Global and Local Hashing Strategies for Duplicate Pruning in Parallel A* Graph Search, IEEE Trans. Parallel and Distr. Systems (to appear).
    • IEEE Trans. Parallel and Distr. Systems
    • Mahapatra, N.1    Dutt, S.2
  • 16
    • 0042243984 scopus 로고
    • Interactive sampling of efficient frontier in multi-objective programming by parallel distributed computation
    • Taipei
    • W.Y. Ng and J. Yang, "Interactive sampling of efficient frontier in multi-objective programming by parallel distributed computation," Proceedings of the Tenth International Conference on Multiple Criteria Decision Making, Taipei, 1992, vol. 2, pp. 325-334.
    • (1992) Proceedings of the Tenth International Conference on Multiple Criteria Decision Making , vol.2 , pp. 325-334
    • Ng, W.Y.1    Yang, J.2
  • 18
    • 2342509352 scopus 로고
    • Department of Management Science and Information Technology, University of Georgia, Athems, GA
    • _, "Manual for the ADBASE multiple objective linear programming package," Department of Management Science and Information Technology, University of Georgia, Athems, GA, 1991.
    • (1991) Manual for the ADBASE Multiple Objective Linear Programming Package
  • 19
    • 0028526191 scopus 로고
    • Random problem generation and the computation of efficient extreme points in multiple objective linear programming
    • _, "Random problem generation and the computation of efficient extreme points in multiple objective linear programming," Computational Optimization and Applications, vol. 3, pp. 333-347, 1994.
    • (1994) Computational Optimization and Applications , vol.3 , pp. 333-347
  • 20
    • 0026382526 scopus 로고
    • Toward a better parallel performance metric
    • X. Sun and J. Gustafson, "Toward a better parallel performance metric," Parallel Computing, vol. 17, pp. 1093-1109, 1991.
    • (1991) Parallel Computing , vol.17 , pp. 1093-1109
    • Sun, X.1    Gustafson, J.2
  • 22
    • 2342582450 scopus 로고
    • Solving multiple objective linear programs on the Intel Paragon
    • R.K. Kalia and P. Vashishta (Eds.), Nova Science Publishers, New York
    • H. Zhang and M.M. Wiecek, "Solving multiple objective linear programs on the Intel Paragon," Toward Teraflop Computing and New Grand Challenge Applications, R.K. Kalia and P. Vashishta (Eds.), Nova Science Publishers, New York, pp. 323-329, 1995.
    • (1995) Toward Teraflop Computing and New Grand Challenge Applications , pp. 323-329
    • Zhang, H.1    Wiecek, M.M.2


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