A SIMPLIFIED CROSS DECOMPOSITION ALGORITHM FOR MULTIPLE RIGHT HAND CHOICE LINEAR PROGRAMMING

スポンサーリンク

概要

• 論文の詳細を見る

• Multiple right hand choice linear programming first studied by Johnson is considered in this paper. An algorithm is suggested for the general purpose multiple right hand choice linear programs. It is a simplified version of the cross decomposition method, one of the recent advances in mathematical programming. As a motivation of our modified dual step a significant relationship has been observed between the optimal solutions of primal sub problems and those of dual sub problems where there is no duality gap. Our computational results show a great improvement in computational efficiency over the simple enumeration method.

• 社団法人日本オペレーションズ・リサーチ学会の論文

著者

• Kim Sehun

  Korea Advanced Inst. Of Sci. And Technol. Daejeon Kor

• Kim S

  Ewha Women's Univ.

• Um Bong-Sik

  Korea Advanced Institute of Science and Technology

• Um B‐s

  Korea Advanced Inst. Science And Technology Taejeon Kor

• Cho Seong-Cheol

  Korea Advanced Institute of Science and Technology

関連論文

• Maximization of Carried Traffic by Prioritizing New Call Attempts in a CDMA Base Station with Finite Receiver Processors(Switching for Communications)
• Hybrid Intrusion Forecasting Framework for Early Warning System
• A Multipurpose Membership Proof System based on Discrete Logarithms
• Curriculum Design and Evaluation for E-Commerce Security Education Using AHP(Educational Technology)
• Efficient Subcarrier and Power Allocation Algorithm in OFDMA Uplink System(Wireless Communication Technologies)
• Analysis on the Effects of Signal Strength Averaging and Drop Timer on Soft Handoff Performance(Terrestrial Radio Communications)
• A SIMPLIFIED CROSS DECOMPOSITION ALGORITHM FOR MULTIPLE RIGHT HAND CHOICE LINEAR PROGRAMMING

スポンサーリンク