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

45 results for “Linear Programming Approach”
Set a search alert
Research ArticleOpen accessIn the abstractA 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 abstractInvestigation the Substitution Capability of Oilseeds in Cropping PatternMahmoud Daneshvar Kakhki, S. Youssefzade, Hamideh Ghodrati AzadiProblem statement: Farm activity is a risky activity special in less developed countries, so all decisions and activities are affected by this phenomenon. Consideration of risk either helps to elimination of deviations in result of model or preparing tools for evolution of some policies that the aim of them is reducing the risk for farmers. Oil seed are the second … …American Journal of Applied Sciences, Vol. 6, Issue 12 · 31 Dec 2009 · 7,177 accessesView PDFCite
Research ArticleOpen accessIn the abstractThe Determination of Optimal Crop Pattern with Aim of Reduction in Hazards of EnvironmentalMahmoud Daneshvar Kakhki, Nasser Sahnoushi, F. Salehi Reza AbadiProblem statement: The purpose of the study was to find the optimal cropping pattern, in Taybad, which maximizes the net return per water cubic meter and per fertilizer kilogram. Approach: A linear programming model and a fuzzy multi-objective fractional programming model were applied and then these models were compared. Results: Result of study showed ratio of net return into consumption … …American Journal of Agricultural and Biological Sciences, Vol. 4, Issue 4 · 31 Dec 2009 · 8,282 accessesView PDFCite
Research ArticleOpen accessIn the abstractOn the Predictability of Risk Box Approach by Genetic Programming Method for Bankruptcy PredictionAlireza Bahiraie, Noor Akma bt Ibrahim, A. K.M. AzharProblem statement: Theoretical based data representation is an important tool for model selection and interpretations in bankruptcy analysis since the numerical representation are much less transparent. Some methodological problems concerning financial ratios such as non-proportionality, non-asymetricity, non-scalicity are solved in this study and we presented a complementary technique for empirical analysis of financial ratios and bankruptcy risk. Approach: This study … …American Journal of Applied Sciences, Vol. 6, Issue 9 · 30 Sep 2009 · 7,948 accessesView PDFCite
Research ArticleOpen accessIn the abstractOptimization 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 abstractBenders' Decomposition Based Heuristics for Large-Scale Dynamic Quadratic Assignment ProblemsSirirat Muenvanichakul, Peerayuth CharnsethikulProblem statement: Dynamic Quadratic Assignment Problem (DQAP) is NP hard problem. Benders decomposition based heuristics method is applied to the equivalent mixed-integer linear programming problem of the original DQAP. Approach: Approximate Benders Decomposition (ABD) generates the ensemble of a subset of feasible layout for Approximate Dynamic Programming (ADP) to determine the sub-optimal optimal solution. A Trust-Region Constraint (TRC) for the … …Journal of Computer Science, Vol. 5, Issue 1 · 31 Jan 2009 · 7,681 accessesView PDFCite
Research ArticleOpen accessIn the abstractTwo Mathematical Modeling Approaches for Integrating Production and Transportation Decisions in the Process IndustryMohamed K. Omar, A. AjithaIn this study we focus on coordination of the production planning of finished products and intermediate products in the process industry. The problem consists of two manufacturing facilities with similar production environment, one producing the intermediates and the other producing end products that are separated by a distance. There is transportation between the facilities. The problem considered has been formulated … …American Journal of Applied Sciences, Vol. 5, Issue 8 · 31 Aug 2008 · 6,521 accessesView PDFCite
Research ArticleOpen accessIn the abstractMINLP 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 abstractNew 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 abstractParallel Approaches for Intervals Analysis of Variable Statistics in Large and Sparse Linear Equations with RHS RangesPeerayuth CharnsethikulThis study proposes an algorithm capable of working in parallel for solving large and sparse linear equations under given right hand side (RHS) ranges. A comparative study to the direct linear programming method is reported theoretically, computationally and discussed. Moreover, the approach can be adapted for the system under domain decompositions structure leading to a better efficiency experimentally. …American Journal of Applied Sciences, Vol. 4, Issue 5 · 31 May 2007 · 6,823 accessesView PDFCite