45 results for “Linear Programming Approach”

Set a search alert

Research ArticleOpen accessAll words, across the recordSolving 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 PDF Cite

Research ArticleOpen accessAll words, across the recordStochastic Optimization for Portfolio Selection Problem with Mean Absolute Negative Deviation MeasureAnton Abdulbasah Kamil, Adli Mustafa, Khlipah IbrahimProblem statement: The most important character within optimization problem is the uncertainty of the future returns. Approach: To handle such problems, we utilized probabilistic methods alongside with optimization techniques. We developed single stage and two stage stochastic programming with recourse. The models were developed for risk adverse investors and the objective of the stochastic programming models is to minimize the … …Journal of Mathematics and Statistics, Vol. 5, Issue 4 · 31 Dec 2009 · 6,947 accessesView PDF Cite

Research ArticleOpen accessAll words, across the recordA Stochastic Knapsack Problem with Continuous Random CapacitySuwitchporn Witchakul, Prapaisri Sudas Na Ayudhaya, Peerayuth CharnsethikulProblem Statement: The problem of allocating a set of items in order to maximize the toal linear profit under uncertain capacity referred as a stochastic knapsack problem with continuous random capacity was studied theoretically and computationally. Approach: Two optimization based heuristic algorithms were proposed and developed for solving the problem and both efficiency and effectiveness are compared with the general … …Journal of Mathematics and Statistics, Vol. 4, Issue 4 · 31 Dec 2008 · 6,946 accessesView PDF Cite

Research ArticleOpen accessAll words, across the recordDesign and Implementation of an Optimal Fuzzy Logic Controller Using Genetic AlgorithmS. Khan, S. F. Abdulazeez, L. W. Adetunji et al.All control systems suffer from problems related to undesirable overshoot, longer settling times and vibrations while going form one state to another state. Most of relevant techniques had been in the form of suggesting modification and improvement in the instrumentation or interfacing part of the control system and the results reported, remain suffering from shortcomings related to hardware parameter dependence … …Journal of Computer Science, Vol. 4, Issue 10 · 31 Oct 2008 · 8,049 accessesView PDF Cite

Research ArticleOpen accessAll words, across the recordOptimization Based Heuristic Approaches for Solving an Integrated One-dimensional Cutting Stock-Transportation ProblemSirirat Wongprakornkul, Peerayuth CharnsethikulIn this work, the integration of the one-dimensional cutting stock problem with multiple cutting facilities and the transportation problem was formulated mathematically as a large-scale discrete optimization problem. Benders partitioning approach and the column-generation technique with the direct method and the proposed heuristic method for solving corresponding integer programming (IP) were developed into three approaches and were used to solve … …Journal of Mathematics and Statistics, Vol. 3, Issue 3 · 30 Sep 2007 · 6,741 accessesView PDF Cite