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

44 results for “Linear Programming Problem”
Set a search alert
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,919 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,062 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,837 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,116 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,459 accessesView PDFCite
Research ArticleOpen accessIn the keywordsOptimal Network Design for Efficient Energy Utilization in Wireless Sensor NetworksChutima Prommak, Sujitra ModhirunProblem statement: This research presents a study of the optimal network design for efficient energy utilization in continuous data-gathering Wireless Sensor Networks (WSNs). We first examine the problem of minimizing the network cost through the minimum number of relay-station installation. Then we further investigate the problem of minimizing the energy consumption of the sensor nodes. Approach: We model the network … …Journal of Computer Science, Vol. 8, Issue 1 · 3 Nov 2011 · 7,350 accessesView PDFCite
Research ArticleOpen accessIn the keywordsA Solution Methodology of Bi-Level Linear Programming Based on Genetic AlgorithmM. S. Osman, W.F. Abd El-Wahed, Mervat M.K. El Shafei, Hanaa B. Abd El WahabProblem statement: We deal with the bi-level linear programming problem. A bi-level programming problem is formulated for a problem in which two Decision-Makers (DMs) make decisions successively. Approach: In this research we studied and designs a Genetic Algorithm (GA) of Bi-Level Linear Programming Problems (BLPP) by constructing the fitness function of the upper-level programming problems based on the definition of … …Journal of Mathematics and Statistics, Vol. 5, Issue 4 · 31 Dec 2009 · 7,184 accessesView PDFCite
Research ArticleOpen accessIn the keywordsNew 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,200 accessesView PDFCite
Research ArticleOpen accessIn the keywordsThe Best Candidates Method for Solving Optimization ProblemsHlayel Abdallah AhmadProblem statement: This study is about describing solution technique called Best Candidates Method (BCM) for solving optimization problems; the goal is to minimize the computation time to get the optimal solution. In this study I apply the BCM to the linear assignment problems (LAP) that is one of the optimization problems in the Operation Research (OR). Approach: The optimization problem … …Journal of Computer Science, Vol. 8, Issue 5 · 27 Feb 2012 · 8,341 accessesView PDFCite
Research ArticleOpen accessIn the keywordsSolving One-Dimensional Cutting Stock Problem with Discrete Demands and Capacitated Planning ObjectiveSirirat Wongprakornkul, Peerayuth CharnsethikulProblem statement: One-dimensional cutting stock problem with discrete demands and capacitated planning objective is an NP hard problem. Approach: The mathematical model with column-generation technique by a branch-and-bound procedure and the heuristic based on the first fit decreasing method are proposed. Then, both approaches were compared and some characteristics were investigated such as upper-bound value, percentage above lower-bound value, computation … …Journal of Mathematics and Statistics, Vol. 6, Issue 2 · 30 Jun 2010 · 7,947 accessesView PDFCite