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

59 articles for “Linear Programming (LP)”
Set a search alert
Also matching:1 special issue
Research ArticleOpen accessIn the keywordsOptimization of Test Scheduling and Test Access for ITC-02 SOC Benchmark CircuitsP. Sakthivel, R. Delhi Babu, P. NarayanasamyProblem statement: This study presented the optimized test scheduling and test access for ITC-02 SOC benchmark circuits using genetic algorithm. In the scheduling procedure of SOC, scheduling problem was formulated as a sequence of two problems and solved. Approach: Test access mechanism width was partitioned into two and three partitions and the applications of test vectors and test vector assignments … …Journal of Computer Science, Vol. 5, Issue 4 · 30 Apr 2009 · 7,315 accessesView PDFCite
Research ArticleOpen accessIn the keywordsMINLP Optimization of Mechanical StructuresS. Šilih, T. Žula, Z. Kravanja, S. KravanjaWe presented optimization of mechanical structures, performed by the Mixed-Integer Nonlinear Programming (MINLP) optimization approach. The MINLP is a combined continuous/discrete optimization technique, where a structural topology and standard/discrete sizes are optimized simultaneously with the continuous variables. Ddiscrete binary 0-1 variables were used to express the discrete decisions. For solution of this non-linear, continuous/discrete and non-convex MINLP class of the … …American Journal of Applied Sciences, Vol. 5, Issue 1 · 31 Jan 2008 · 7,125 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 keywordsOn Selecting &#34r&#34 Items From &#34m&#34 Independent GroupsEzz H. Abdelfattah, Mohamed Hafez, Said F. Tantawydoesn’t consider the competition “between” these groups, but it only considers the competition “within” the groups. In this study we discuss the selection by considering the competition with both between and within the groups, by using a Linear Programming (LP) approach and depending on the True Position (TP) introduced by Abdelfattah [1], which depends on rescaling the data for each … …Journal of Mathematics and Statistics, Vol. 1, Issue 2 · 30 Jun 2005 · 6,054 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 keywordsDevelopment of Software Reliability Growth Models for Industrial Applications Using Fuzzy LogicSultan AljahdaliProblem statement: The utilization of Software Reliability Growth Models (SRGM) plays a major role in monitoring progress, accurately predicting the number of faults in the software during both development and testing processes; define the release date of a software product, helps in allocating resources and estimating the cost for software maintenance. This leads to achieving the required reliability level of … …Journal of Computer Science, Vol. 7, Issue 10 · 9 Aug 2011 · 7,007 accessesView PDFCite
Research ArticleOpen accessIn the keywordsDistinguishing Congestion and Technical Inefficiency in Presence Undesirable OutputFaranak Hosseinzadeh Saljooghi, Mohammad Mahallati RayeniProblem statement: This study focuses on problems of congestion and how they might be treated in universities, also investigates a methodology to measure undesirable outputs congestion in addition to inputs congestion, from both theoretical and empirical perspectives. Congestion indicates an economic state where inputs are overly invested. Evidence of congestion occurs whenever reducing some inputs can increase outputs. Approach: The … …American Journal of Applied Sciences, Vol. 8, Issue 9 · 2 Aug 2011 · 7,372 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
Research ArticleOpen accessIn the keywordsStochastic 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 PDFCite
Research ArticleOpen accessIn the keywordsOptimization 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 PDFCite