경영과학 (Korean Management Science Review)

한국경영과학회 (The Korean Operations Research and Management Science Society)
권호 표지

An interactive weight vector space reduction procedure for bicriterion linear programming

  • 발행 : 1996.06.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

This paper develops a simple interactive procedure which can be efficiently used to solve a bicriteria linear programming problem. The procedure exploits the relatively simple structure of the bicriterion linear programming problem. Its application to a transportation problem is also presented. The results demonstrate that the method developed in this paper could be easily applicable to any bicriteria linear program in general.

키워드

참고문헌

  1. Journal of Optimization Theory and Applications v.28 Vector Maximization with Two Objective Functions Benson,H.P.
  2. Management Science v.33 Bicriteria Mathematical Programming Model for Nutrition Planning in Developing Nations Benson,H.P.;Morin,T.L.
  3. Journal of Optimization Theory and Applications v.88 no.1 Outcome-Based Algorithm for Optimizing over the Efficient Set of a Bicriteria Linear Programming Problem Benson,H.P.;Lee,D.
  4. Management Science v.30 An Overview of Techniques for Solving Multiobjective Mathematical Programs Evans,G.W.
  5. Operational Research Quarterly v.28 The enumeration of the set of all efficient solutions for a linear multiple objective program Isemann,H.
  6. Naval Research Logistics Quarterly v.26 The enumeration of all efficient solutions for a linear multiple-objective transportation problems Isemann,H.
  7. Multiple Criteria Optimization: Theory, Computation, and Application Steuer,R.E.
  8. Zeitschrift fur Operations Research v.31 Applied Bi-Objective Programs van Moeseke,P.
  9. Journal of Optimization Theory and Applications v.49 The set of all nondominated solutions in linear cases and a multiple criteria simplex method Yu,P.L.;Zeleny,M.