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

145 results for “programming problem”
Set a search alert
Research ArticleOpen accessPhrase 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 accessPhrase 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 accessPhrase in the titleUsing Feasible Direction to Find All Alternative Extreme Optimal Points for Linear Programming ProblemS. F. TantawyWe presented a feasible direction method to find all optimal extreme points for the linear programming problem. Our method depends on the conjugate gradient projection method starting with an initial point we generate a sequence of feasible directions towards all alternative extremes. …Journal of Mathematics and Statistics, Vol. 3, Issue 3 · 30 Sep 2007 · 7,065 accessesView PDFCite
Research ArticleOpen accessPhrase 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 accessPhrase 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
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 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 accessIn the keywordsLayout Optimization in a Fitness Industry: An Application of QAP Formulation and Heuristic Approachesİbrahim Miraç Eligüzel, Eren Özceylan, Yakup AtasagunThe Quadratic Assignment Problem (QAP) is the problem of determining a one-to-one and onto assignment between two sets, each consisting of n objects (e.g., n facilities and n locations) so as to minimize the sum of the distance × flow associated with pairs of assignments. In this study, QAP formulation is applied to a fitness center to assign the sports … …Journal of Computer Science, Vol. 17, Issue 4 · 3 May 2021 · 6,686 accessesView PDFCite
Research ArticleOpen accessIn the keywordsUSING COLUMN GENERATION TECHNIQUE TO ESTIMATE PROBABILITY STATISTICS IN TRANSITION MATRIX OF LARGE SCALE MARKOV CHAIN WITH LEAST ABSOLUTE DEVIATION CRITERIAWanida Lerspipatthananon, Peerayuth CharnsethikulThe Least Absolute Deviation (LAD) method is the one of many methods used to estimate transition probability matrix of Markov Chain. It can be formulated as a Linear Programming Problem (LP) and solved using its regular state of the art software. However, when the Markov Chain has a large number of states and historical state probabilities data, the corresponding LP … …Journal of Mathematics and Statistics, Vol. 10, Issue 3 · 23 Sep 2014 · 7,121 accessesView PDFCite
Research ArticleOpen accessIn the keywordsNetwork Planning and Optimization for Multi-Hop Relay Placement in WiMAX NetworksChitapong Wechtaison, Chutima PrommakProblem statement: Wireless access networks can provide high level of quality of services at low network installation budget if the networks are planned by using proper methods. In this research, we developed efficient network planning methods for Wireless Interoperability for Microwave Access (WiMAX) networks in which the multiple hops of relay stations are deployed. Approach: An integer linear programming model … …Journal of Computer Science, Vol. 8, Issue 9 · 9 Aug 2012 · 7,463 accessesView PDFCite