TITLE

Outcome Space Branch and Bound Algorithm for Globally Solving A Class of Linear Multiplicative Programming

AUTHOR(S)
Jingben Yin; Jing Chen
PUB. DATE
January 2013
SOURCE
International Journal of Digital Content Technology & its Applic;Jan2013, Vol. 7 Issue 1, p167
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
This article present an outcome space branch and bound algorithm for globally solving a class of multiplicative programming problems. The main computation involve in solving the series of linear programming problems, and the algorithm economizes the required computations by conducting the branch and bound search in outcome space. The proposed algorithm will be convergent to the global optimal solution by means of the subsequent solutions of the sequence of linear relaxation programming problems in outcome space. Numerical experiments show that the proposed algorithm is feasible.
ACCESSION #
98865178

 

Related Articles

  • Chaotic Harmony Search Algorithm with Different Chaotic Maps for Solving Assignment Problems. Abdel-Raouf, Osama; El-henawy, Ibrahim; Abdel-Baset, Mohamed // International Journal of Computer Applications;Jan2014, Vol. 86, p8 

    This paper presents an improved version of a harmony meta-heuristic algorithm with different chaotic maps, (IHSCH), for solving the linear assignment problem. The proposed algorithm uses chaotic behavior to generation a candidate solution in a behavior similar to acoustic monophony. Numerical...

  • A Decomposition Algorithm for Solving a Three Level Large Scale linear Programming Problem. Sultan, T. I.; Emam, O. E.; Abohany, A. A. // Applied Mathematics & Information Sciences;2014, Vol. 8 Issue 5, p2217 

    This paper presents a three level large scale linear programming problem in which the objective functions at every level are to be maximized. A three level programming problem can be thought as a static version of the Stackelberg strategy. An algorithm for solving a three planner model and a...

  • Relaxation Method for Globally Solving a Class of Multiplicative Programming Problems. Yunrui Guo; Jing Chen; Jingben Yin // International Journal of Digital Content Technology & its Applic;Jan2013, Vol. 7 Issue 1, p178 

    This article present a branch and bound algorithm for globally solving a class of multiplicative problems by using relaxation method. By utilizing character of bilinear function, a sequence of linear relaxation programming of the initial non-convex programming problem are derived which are...

  • Multiattribute decision making models and methods using interval-valued fuzzy sets. Hongmei Ju; Fenghua Qi // Journal of Chemical & Pharmaceutical Research;2014, Vol. 6 Issue 7, p465 

    The concept of interval-valued fuzzy sets is the generalization of the concept of fuzzy sets. The theory of interval-valued fuzzy sets is well suited to dealing with vagueness. Recently, interval-valued fuzzy sets have been used to build soft decision making models that can accommodate imprecise...

  • OPTIMIZATION OF BODIES WITH LOCALLY PERIODIC MICROSTRUCTURE BY VARYING THE PERIODICITY PATTERN. BARBAROSIE, CRISTIAN; TOADER, ANCA-MARIA // Networks & Heterogeneous Media;Sep2014, Vol. 9 Issue 3, p433 

    This paper describes a numerical method to optimize elastic bodies featuring a locally periodic microscopic pattern. A new idea, of optimizing the periodicity cell itself, is considered. In previously published works, the authors have found that optimizing the shape and topology of the model...

  • Approximating Sparse Covering Integer Programs Online. Gupta, Anupam; Nagarajan, Viswanath // Mathematics of Operations Research;Nov2014, Vol. 39 Issue 4, p998 

    A covering integer program (CIP) is a mathematical program of the form min{cT x | Ax ≥ 1, 0 ≤ x ≤ u, x ∈ Zn}, where all entries in A, c, u are nonnegative. In the online setting, the constraints (i.e., the rows of the constraint matrix A) arrive over time, and the...

  • Technology of multilinear programming in naturally conditioned models. II. Karbovskii, I. // Automation & Remote Control;Jan2015, Vol. 76 Issue 1, p72 

    New algorithms for program realization of the phase method of multilinear programming were presented, and the behavior of this method at the stagnation points was studied

  • Online Make-to-Order Joint Replenishment Model: Primal-Dual Competitive Algorithms. Buchbinder, Niv; Kimbrel, Tracy; Levi, Retsef; Makarychev, Konstantin; Sviridenko, Maxim // Operations Research;Jul/Aug2013, Vol. 61 Issue 4, p1014 

    In this paper, we study an online make-to-order variant of the classical joint replenishment problem (JRP) that has been studied extensively over the years and plays a fundamental role in broader planning issues, such as the management of supply chains. In contrast to the traditional approaches...

  • Study on Quasi-Linear Stochastic Programming Model and Its Solution. Ji Xiangjun; Jin Chenxia // International Journal of Digital Content Technology & its Applic;Feb2013, Vol. 7 Issue 4, p320 

    In this paper, we first analyze the features and shortcomings of existing stochastic programming methods. For the bottleneck of higher computational complexity, we give the concept of reliability coefficient and a quasi-linear processing pattern for chance-constrain based on mathematic...

Share

Other Topics