A PARAMETRIC SUCCESSIVE UNDERESTIMATION METHOD FOR CONVEX PROGRAMMING PROBLEMS WITH AN ADDITIONAL CONVEX MULTIPLICATIVE CONSTRAINT
スポンサーリンク
概要
- 論文の詳細を見る
This paper addresses itself to an algorithm for a convex minimization problem with an additional convex multiplicative constraint. A convex multiplicative constraint is such that a product of two convex functions is less than or equal to some. constant. It is shown that this nonconvex problem can be solved by solving a sequence of convex programming problems. The basic idea of this algorithm is to embed the original problem into a problem in a higher dimensional space and to apply a parametric programming technique. A branch-and-bound algorithm is proposed for obtaining an ε-optimal solution in finitely many iterations. Computational results indicate that this algorithm is efficient for linear programs with an additional linear multiplicative constraint.
- 社団法人日本オペレーションズ・リサーチ学会の論文
著者
-
Yamamoto Yoshitsugu
University Of Tsukuba
-
久野 誉人
筑波大学
-
Konno Hiroshi
Tokyo Institute of Technology
-
Kuno Takahito
University of Tsukuba
関連論文
- 1-C-1 ポリゴン情報の最小トライアングルストリップ化(つくばOR学生発表(3))
- 逆凸制約付き線形計画問題に対する分枝限定法(非線形計画)
- 逆凸制約付き線形計画問題に対する解法(非線形計画(2))
- 凹費用生産輸送問題に対する単体分枝限定法(最適化(2))
- Global Minimization of a Generalized Convex Muptiplicative Function
- Parametric Simplex Algorithms for a Class of NP Complete Problems : Whose Average Numver of Steps are Polynomial
- An Outer Approximation Method for Minimizing the Product of p Convex Functions on a Convex Set
- Convex Multiplicative Programming and its generalization (2)
- Convex Multiplicative Programming and its generalization (1)
- Linear Multiplicative Programming
- Generalized Linear Mutiplicative Programming
- 有効解集合上での最小化問題に対するパラメトリック解法(非線形計画(2))
- 1-A-7 計算と最適化の新展開に向けて(計算と最適化(1))
- A NOTE ON A THEOREM OF CONTINUUM OF ZERO POINTS
- A FAST ALGORITHM FOR SOLVING LARGE SCALE MEAN-VARIANCE MODELS BY COMPACT FACTORIZATION OF COVARIANCE MATRICES
- A PARAMETRIC SIMPLEX ALGORITHM FOR A CERTAIN CLASS OF RANK TWO REVERSE CONVEX PROGRAMS
- 1-C-3 Global Optimisation in the New Zealand Electricity Market
- 第58回シンポジウムルポ(情報の窓)
- 昇格料金を徴収しない2クラス・キャビンに対する収益管理のための動的モデル
- 乗法計画問題は解ける!
- George B. Dantzig and Mukund N. Thapa 著, Linear Programming 1 : Introduction, (Springer Series in Operations Research), Springer-Verlag, 435頁, 1997年, 定価9,340円
- 非凸計画問題≠解けない問題 : 分枝限定法による大域的最適化 (大域的最適化)
- Solving Certain Classes of Production-Transportation Problems with Concave Production Cost
- Maximum-Area Rectangle Contained in a Convex Set of Two Dimensions
- A PARAMETRIC SUCCESSIVE UNDERESTIMATION METHOD FOR CONVEX PROGRAMMING PROBLEMS WITH AN ADDITIONAL CONVEX MULTIPLICATIVE CONSTRAINT
- Globally Determining a Minimum-Area Rectangle Enclosing the Projection of a Higher-Dimensional Set
- OUTER APPROXIMATION METHOD FOR THE MINIMUM MAXIMAL FLOW PROBLEM
- RANKING BY RELATIONAL POWER BASED ON DIGRAPHS
- A SIMPLICIAL BRANCH-AND-BOUND ALGORITHM FOR PRODUCTION-TRANSPORTATION PROBLEMS WITH INSEPARABLE CONCAVE PRODUCTION COST
- A STUDY ON LINEAR INEQUALITY REPRESENTATION OF SOCIAL WELFARE FUNCTIONS
- OUTER APPROXIMATION ALGORITHMS FOR LOWER RANK BILINEAR PROGRAMMING PROBLEMS
- Minimal Cost Rebalancing under Concave Transaction Costs and Minimal Transaction Unit Constraints
- MEAN-ABSOLUTE DEVIATION PORTFOLIO OPTIMIZATION MODEL UNDER TRANSACTION COSTS
- LAGRANGIAN RELAXATION AND PEGGING TEST FOR LINEAR ORDERING PROBLEMS(SCOPE (Seminar on Computation and OPtimization for new Extensions))
- SOLVING LARGE SCALE MEAN-VARIANCE MODELS WITH DENSE NON-FACTORABLE COVARIANCE MATRICES