Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

985 articles for “program”
Set a search alert
Research ArticleOpen accessEvery word in the titleAn Original Geometric Programming Problem Algorithm to Solve Two Coefficients Sensitivity AnalysisAbbas Y. Al-Bayati, Huda E. KhalidProblem statement: It has been noticed by Dinkel and Kochenberger that they developed sensitivity procedure for Posynomial Geometric Programming Problems based on making a small changes in one coefficient. Approach: This study presented an original algorithm for finding the ranging analysis while studying the effect of perturbations in the original coefficients without resolving the problem, this proposed procedure had been … …American Journal of Engineering and Applied Sciences, Vol. 2, Issue 2 · 30 Jun 2009 · 7,371 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleIntegrating Gene Expression Programming and Geographic Information Systems for Solving a Multi Site Land Use Allocation ProblemKhalid A. EldrandalyProblem statement: Land use planning may be defined as the process of allocating different activities or uses to specific units of area within a region. Multi sites Land Use Allocation Problems (MLUA) refer to the problem of allocating more than one land use type in an area. MLUA problem is one of the truly NP Complete (combinatorial optimization) problems. Approach: … …American Journal of Applied Sciences, Vol. 6, Issue 5 · 31 May 2009 · 7,856 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleA Graphical Based Method for a Class of One-Stage Bounded Variables and Single Constrained Linear Programming ProblemsSuwitchaporn Witchakul, Prapaisri Sudasna-na-Ayudthya, Peerayuth Charnsethikul, Kamlesh MathurAn efficient and effective special purpose method is proposed for solving a class of one-stage single constrained linear programming problems with a finite number of right hand side scenarios and bounded variables. We compare our proposed method with a general purpose method using CPLEX interactive optimizer. For various m and n, by using elapsed computational time as the criteria, our … …American Journal of Applied Sciences, Vol. 4, Issue 12 · 31 Dec 2007 · 6,922 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleNew Integer Programming Formulations of the Generalized Travelling Salesman ProblemPetrica C. PopThe Generalized Travelling Salesman Problem, denoted by GTSP, is a variant of the classical travelling salesman problem (TSP), in which the nodes of an undirected graph are partitioned into node sets (clusters) and the salesman has to visit exactly one node from every cluster. In this paper we described six distinct formulations of the GTSP as an integer programming. Apart … …American Journal of Applied Sciences, Vol. 4, Issue 11 · 30 Nov 2007 · 7,204 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleEmetine produce Entamoeba histolytica Death by Inducing a Programmed Cell DeathJ.D. Villalba-Magdaleno, R. Rojas, C. Gómez et al.Amoebiasis is a major public health problem in tropical and subtropical countries. Although a number of antiamoebic agents are used for its treatment and the molecular targets of these drugs have been identified, the biochemical and physiological mechanisms that produce trophozoite death are little known. The present study dates the in vitro induction of programmed cell death (PCD) in E. … …American Journal of Infectious Diseases, Vol. 3, Issue 2 · 30 Jun 2007 · 7,214 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleOptimal Rejuvenation Scheduling of Distributed Computation Based on Dynamic ProgrammingHiroyuki Okamura, Kazuki Iwamoto, Tadashi DohiRecently, a complementary approach to handle transient software failures, called software rejuvenation, is becoming popular as a proactive fault management technique in operational software systems. In this study, we develop the optimal scheduling algorithms to trigger software rejuvenation in distributed computation circumstance. In particular, we focus on two different computation circumstances in terms of detection of failures. Based on the … …Journal of Computer Science, Vol. 2, Issue 6 · 30 Jun 2006 · 6,389 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleOn Stability in Multiobjective Integer Linear Programming: A Stochastic ApproachWalied H. Sharif, Omar M. SaadIn this study we consider a multiobjective integer linear stochastic programming problem with individual chance constraints. We assume that there is randomness in the right-hand sides of the constraints only and that the random variables are normally distributed. Some stability notions for such problem are characterized. An auxiliary problem is discussed and an algorithm as well as an illustrative example … …American Journal of Applied Sciences, Vol. 2, Issue 12 · 31 Dec 2005 · 6,712 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleExtension to Sufficient Optimality Conditions in Complex ProgrammingE. A. Youness, M. E. ElbrolosyIn this study we extend the sufficient optimality conditions of complex programming problems to a large class of functions that include the two parts (real and imaginary) of the objective function. The sufficient conditions were established under generalized forms of convexity assumptions. The previous results that considered the real part only can be deduced as special cases. …Journal of Mathematics and Statistics, Vol. 1, Issue 1 · 31 Mar 2005 · 6,249 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleOn Quasi E-Convex Bilevel Programming ProblemE. A. Youness, O. M.A. Al-OlaaBilevel programming problems involve two optimization problems where the data of the first one is implicity determined by the solution of the second. This study introduces the notions of E-convexity and quasi E-convexity in bilevel programming problems to generalize quasi convex bilevel programming problems. …American Journal of Applied Sciences, Vol. 2, Issue 2 · 28 Feb 2005 · 6,574 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleSolving Linear Programming Problems on the Parallel Virtual Machine EnvironmentJrJung Lyu, Hsing Luh, Ming-Chang LeeThis study developed a parallel algorithm to efficiently solve linear programming models. The proposed algorithm utilizes the Dantzig-Wolfe Decomposition Principle and can be easily implemented in a general distributed computing environment. The analytical performance of the well-known method, including the speedup upper bound and lower bound limits, was derived. Numerical experiments are also provided in order to verify the complexity … …American Journal of Applied Sciences, Vol. 1, Issue 2 · 30 Jun 2004 · 7,841 accessesView PDFCite