TITLE

Relaxation Method for Globally Solving a Class of Multiplicative Programming Problems

AUTHOR(S)
Yunrui Guo; Jing Chen; Jingben Yin
PUB. DATE
January 2013
SOURCE
International Journal of Digital Content Technology & its Applic;Jan2013, Vol. 7 Issue 1, p178
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
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 embedded in branch and bound algorithm. The proposed algorithm will be convergent to the global optimal solution by means of the subsequent solutions of the series of linear relaxation programming problems. Numerical results are given to show the feasibility of the proposed algorithm.
ACCESSION #
98865179

 

Related Articles

  • The Painlevé Tests, Bäcklund Transformation and Bilinear Form for the KdV Equation with a Self-Consistent Source. Yali Shen; Fengqin Zhang; Xiaomei Feng // Discrete Dynamics in Nature & Society;2012, Special section p1 

    The Painlevée property and Bäcklund transformation for the KdV equation with a self-consistent source are presented. By testing the equation, it is shown that the equation has the Painlevée property. In order to further prove its integrality, we give its bilinear form and construct its...

  • 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...

  • Outcome Space Branch and Bound Algorithm for Globally Solving A Class of Linear Multiplicative Programming. Jingben Yin; Jing Chen // International Journal of Digital Content Technology & its Applic;Jan2013, Vol. 7 Issue 1, p167 

    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...

  • 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...

  • 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...

  • Dynamic Facility Location with Generalized Modular Capacities. Jena, Sanjay Dominik; Cordeau, Jean-François; Gendron, Bernard // Transportation Science;Aug2015, Vol. 49 Issue 3, p484 

    Location decisions are frequently subject to dynamic aspects such as changes in customer demand. Often, flexibility regarding the geographic location of facilities, as well as their capacities, is the only solution to such issues. Even when demand can be forecast, finding the optimal schedule...

  • A Fuzzy Algorithm for Solving a Class of Bi-Level Linear Programming Problem. Lu Zhang // Applied Mathematics & Information Sciences;2014, Vol. 8 Issue 4, p1923 

    This paper proposes a kind of bi-level linear programming problem, in which there are two decision makers in a hierarchy and they have a common variable. To deal with this bi-level problem, we introduce a virtual decision maker, who controls the common variable to maximize the sum of the...

  • The Research on Tetrahedral Mesh Optimization Algorithm of the Double Channel Pump. Liu Houlin; Lu Mingzhen; Tan Minggao; Dong Liang; Ren Yun // Applied Mathematics & Information Sciences;2014, Vol. 8 Issue 3, p1041 

    The quality of mesh generation is very important for the computational simulation of the double channel pump. According to the special characteristics of the double channel pump, there exist a great amount of poor-quality elements, most of which are so called Sliver elements, generated by the...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics