OUTER APPROXIMATION ALGORITHMS FOR LOWER RANK BILINEAR PROGRAMMING PROBLEMS

スポンサーリンク

概要

• 論文の詳細を見る

• Two outer approximation algorithms for lower rank bilinear programming problems are developed. The first algorithm can generate an ⋴-optimal solution rather efficiently when the rank of the objective function is less than five. The second algorithm is exact, and finitely convergent, yet with slower convergent property, compared to the first.

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

著者

• Konno Hiroshi

  Tokyo Institute of Technology

• Yajima Yasutoshi

  Department Of Mathematical And Computing Science Tokyo Institute Of Technology

• Yajima Yasutoshi

  Department Of Industrial Engineering And Management Tokyo Institute Of Technology

関連論文

• A FAST ALGORITHM FOR SOLVING LARGE SCALE MEAN-VARIANCE MODELS BY COMPACT FACTORIZATION OF COVARIANCE MATRICES
• A PARAMETRIC SUCCESSIVE UNDERESTIMATION METHOD FOR CONVEX PROGRAMMING PROBLEMS WITH AN ADDITIONAL CONVEX MULTIPLICATIVE CONSTRAINT
• An Algorithm for a Concave Production Cost Network Flow Problem
• OUTER APPROXIMATION ALGORITHMS FOR LOWER RANK BILINEAR PROGRAMMING PROBLEMS
• Positive Semidefinite Relaxations for Distance Geometry Problems
• Minimal Cost Rebalancing under Concave Transaction Costs and Minimal Transaction Unit Constraints
• MEAN-ABSOLUTE DEVIATION PORTFOLIO OPTIMIZATION MODEL UNDER TRANSACTION COSTS
• SOLVING LARGE SCALE MEAN-VARIANCE MODELS WITH DENSE NON-FACTORABLE COVARIANCE MATRICES

スポンサーリンク