CINXE.COM

<!DOCTYPE html> <html lang="en" dir="ltr"> <head>  <script async src="https://www.googletagmanager.com/gtag/js?id=G-P63WKM1TM1"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-P63WKM1TM1'); </script>  <script type="text/javascript" > (function(m,e,t,r,i,k,a){m[i]=m[i]||function(){(m[i].a=m[i].a||[]).push(arguments)}; m[i].l=1*new Date(); for (var j = 0; j < document.scripts.length; j++) {if (document.scripts[j].src === r) { return; }} k=e.createElement(t),a=e.getElementsByTagName(t)[0],k.async=1,k.src=r,a.parentNode.insertBefore(k,a)}) (window, document, "script", "https://mc.yandex.ru/metrika/tag.js", "ym"); ym(55165297, "init", { clickmap:false, trackLinks:true, accurateTrackBounce:true, webvisor:false }); </script> <noscript><div><img src="https://mc.yandex.ru/watch/55165297" style="position:absolute; left:-9999px;" alt="" /></div></noscript>    <title>Search results for: dynamic programming technique</title> <meta name="description" content="Search results for: dynamic programming technique"> <meta name="keywords" content="dynamic programming technique"> <meta name="viewport" content="width=device-width, initial-scale=1, minimum-scale=1, maximum-scale=1, user-scalable=no"> <meta charset="utf-8"> <link href="https://cdn.waset.org/favicon.ico" type="image/x-icon" rel="shortcut icon"> <link href="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/css/bootstrap.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/plugins/fontawesome/css/all.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/css/site.css?v=150220211555" rel="stylesheet"> </head> <body> <header> <div class="container"> <nav class="navbar navbar-expand-lg navbar-light"> <a class="navbar-brand" href="https://waset.org"> <img src="https://cdn.waset.org/static/images/wasetc.png" alt="Open Science Research Excellence" title="Open Science Research Excellence" /> </a> <button class="d-block d-lg-none navbar-toggler ml-auto" type="button" data-toggle="collapse" data-target="#navbarMenu" aria-controls="navbarMenu" aria-expanded="false" aria-label="Toggle navigation"> <span class="navbar-toggler-icon"></span> </button> <div class="w-100"> <div class="d-none d-lg-flex flex-row-reverse"> <form method="get" action="https://waset.org/search" class="form-inline my-2 my-lg-0"> <input class="form-control mr-sm-2" type="search" placeholder="Search Conferences" value="dynamic programming technique" name="q" aria-label="Search"> <button class="btn btn-light my-2 my-sm-0" type="submit"><i class="fas fa-search"></i></button> </form> </div> <div class="collapse navbar-collapse mt-1" id="navbarMenu"> <ul class="navbar-nav ml-auto align-items-center" id="mainNavMenu"> <li class="nav-item"> <a class="nav-link" href="https://waset.org/conferences" title="Conferences in 2024/2025/2026">Conferences</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/disciplines" title="Disciplines">Disciplines</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/committees" rel="nofollow">Committees</a> </li> <li class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="#" id="navbarDropdownPublications" role="button" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false"> Publications </a> <div class="dropdown-menu" aria-labelledby="navbarDropdownPublications"> <a class="dropdown-item" href="https://publications.waset.org/abstracts">Abstracts</a> <a class="dropdown-item" href="https://publications.waset.org">Periodicals</a> <a class="dropdown-item" href="https://publications.waset.org/archive">Archive</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/page/support" title="Support">Support</a> </li> </ul> </div> </div> </nav> </div> </header> <main> <div class="container mt-4"> <div class="row"> <div class="col-md-9 mx-auto"> <form method="get" action="https://publications.waset.org/abstracts/search"> <div id="custom-search-input"> <div class="input-group"> <i class="fas fa-search"></i> <input type="text" class="search-query" name="q" placeholder="Author, Title, Abstract, Keywords" value="dynamic programming technique"> <input type="submit" class="btn_search" value="Search"> </div> </div> </form> </div> </div> <div class="row mt-3"> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Commenced</strong> in January 2007</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Frequency:</strong> Monthly</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Edition:</strong> International</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Paper Count:</strong> 10923</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: dynamic programming technique</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10923</span> Optimum Stratiﬁcation of a Skewed Population</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=D.%20K.%20Rao">D. K. Rao</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20G.%20M.%20Khan"> M. G. M. Khan</a>, <a href="https://publications.waset.org/abstracts/search?q=K.%20G.%20Reddy"> K. G. Reddy</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The focus of this paper is to develop a technique of solving a combined problem of determining Optimum Strata Boundaries (OSB) and Optimum Sample Size (OSS) of each stratum, when the population understudy is skewed and the study variable has a Pareto frequency distribution. The problem of determining the OSB is formulated as a Mathematical Programming Problem (MPP) which is then solved by dynamic programming technique. A numerical example is presented to illustrate the computational details of the proposed method. The proposed technique is useful to obtain OSB and OSS for a Pareto type skewed population, which minimizes the variance of the estimate of population mean. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=strati%EF%AC%81ed%20sampling" title="stratiﬁed sampling">stratiﬁed sampling</a>, <a href="https://publications.waset.org/abstracts/search?q=optimum%20strata%20boundaries" title=" optimum strata boundaries"> optimum strata boundaries</a>, <a href="https://publications.waset.org/abstracts/search?q=optimum%20sample%20size" title=" optimum sample size"> optimum sample size</a>, <a href="https://publications.waset.org/abstracts/search?q=pareto%20distribution" title=" pareto distribution"> pareto distribution</a>, <a href="https://publications.waset.org/abstracts/search?q=mathematical%20programming%20problem" title=" mathematical programming problem"> mathematical programming problem</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20programming%20technique" title=" dynamic programming technique"> dynamic programming technique</a> </p> <a href="https://publications.waset.org/abstracts/5894/optimum-stratification-of-a-skewed-population" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/5894.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">453</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10922</span> On Optimum Stratification</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20G.%20M.%20Khan">M. G. M. Khan</a>, <a href="https://publications.waset.org/abstracts/search?q=V.%20D.%20Prasad"> V. D. Prasad</a>, <a href="https://publications.waset.org/abstracts/search?q=D.%20K.%20Rao"> D. K. Rao</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this manuscript, we discuss the problem of determining the optimum stratification of a study (or main) variable based on the auxiliary variable that follows a uniform distribution. If the stratification of survey variable is made using the auxiliary variable it may lead to substantial gains in precision of the estimates. This problem is formulated as a Nonlinear Programming Problem (NLPP), which turn out to multistage decision problem and is solved using dynamic programming technique. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=auxiliary%20variable" title="auxiliary variable">auxiliary variable</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20programming%20technique" title=" dynamic programming technique"> dynamic programming technique</a>, <a href="https://publications.waset.org/abstracts/search?q=nonlinear%20programming%20problem" title=" nonlinear programming problem"> nonlinear programming problem</a>, <a href="https://publications.waset.org/abstracts/search?q=optimum%20stratification" title=" optimum stratification"> optimum stratification</a>, <a href="https://publications.waset.org/abstracts/search?q=uniform%20distribution" title=" uniform distribution"> uniform distribution</a> </p> <a href="https://publications.waset.org/abstracts/6677/on-optimum-stratification" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/6677.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">331</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10921</span> Spatial Interpolation Technique for the Optimisation of Geometric Programming Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Debjani%20Chakraborty">Debjani Chakraborty</a>, <a href="https://publications.waset.org/abstracts/search?q=Abhijit%20Chatterjee"> Abhijit Chatterjee</a>, <a href="https://publications.waset.org/abstracts/search?q=Aishwaryaprajna"> Aishwaryaprajna</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Posynomials, a special type of polynomials, having singularities, pose difficulties while solving geometric programming problems. In this paper, a methodology has been proposed and used to obtain extreme values for geometric programming problems by nth degree polynomial interpolation technique. Here the main idea to optimise the posynomial is to fit a best polynomial which has continuous gradient values throughout the range of the function. The approximating polynomial is smoothened to remove the discontinuities present in the feasible region and the objective function. This spatial interpolation method is capable to optimise univariate and multivariate geometric programming problems. An example is solved to explain the robustness of the methodology by considering a bivariate nonlinear geometric programming problem. This method is also applicable for signomial programming problem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=geometric%20programming%20problem" title="geometric programming problem">geometric programming problem</a>, <a href="https://publications.waset.org/abstracts/search?q=multivariate%20optimisation%20technique" title=" multivariate optimisation technique"> multivariate optimisation technique</a>, <a href="https://publications.waset.org/abstracts/search?q=posynomial" title=" posynomial"> posynomial</a>, <a href="https://publications.waset.org/abstracts/search?q=spatial%20interpolation" title=" spatial interpolation"> spatial interpolation</a> </p> <a href="https://publications.waset.org/abstracts/70385/spatial-interpolation-technique-for-the-optimisation-of-geometric-programming-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/70385.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">371</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10920</span> Finite Dynamic Programming to Decision Making in the Use of Industrial Residual Water Treatment Plants</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Oscar%20Vega%20Camacho">Oscar Vega Camacho</a>, <a href="https://publications.waset.org/abstracts/search?q=Andrea%20Vargas"> Andrea Vargas</a>, <a href="https://publications.waset.org/abstracts/search?q=Ellery%20Ariza"> Ellery Ariza</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents the application of finite dynamic programming, specifically the "Markov Chain" model, as part of the decision making process of a company in the cosmetics sector located in the vicinity of Bogota DC. The objective of this process was to decide whether the company should completely reconstruct its waste water treatment plant or instead optimize the plant through the addition of equipment. The goal of both of these options was to make the required improvements in order to comply with parameters established by national legislation regarding the treatment of waste before it is released into the environment. This technique will allow the company to select the best option and implement a solution for the processing of waste to minimize environmental damage and the acquisition and implementation costs. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=decision%20making" title="decision making">decision making</a>, <a href="https://publications.waset.org/abstracts/search?q=markov%20chain" title=" markov chain"> markov chain</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=waste%20water" title=" waste water"> waste water</a> </p> <a href="https://publications.waset.org/abstracts/12123/finite-dynamic-programming-to-decision-making-in-the-use-of-industrial-residual-water-treatment-plants" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/12123.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">412</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10919</span> Application of Finite Dynamic Programming to Decision Making in the Use of Industrial Residual Water Treatment Plants</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Oscar%20Vega%20Camacho">Oscar Vega Camacho</a>, <a href="https://publications.waset.org/abstracts/search?q=Andrea%20Vargas%20Guevara"> Andrea Vargas Guevara</a>, <a href="https://publications.waset.org/abstracts/search?q=Ellery%20Rowina%20Ariza"> Ellery Rowina Ariza</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents the application of finite dynamic programming, specifically the "Markov Chain" model, as part of the decision making process of a company in the cosmetics sector located in the vicinity of Bogota DC. The objective of this process was to decide whether the company should completely reconstruct its wastewater treatment plant or instead optimize the plant through the addition of equipment. The goal of both of these options was to make the required improvements in order to comply with parameters established by national legislation regarding the treatment of waste before it is released into the environment. This technique will allow the company to select the best option and implement a solution for the processing of waste to minimize environmental damage and the acquisition and implementation costs. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=decision%20making" title="decision making">decision making</a>, <a href="https://publications.waset.org/abstracts/search?q=Markov%20chain" title=" Markov chain"> Markov chain</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=wastewater" title=" wastewater"> wastewater</a> </p> <a href="https://publications.waset.org/abstracts/12122/application-of-finite-dynamic-programming-to-decision-making-in-the-use-of-industrial-residual-water-treatment-plants" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/12122.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">487</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10918</span> Iterative Dynamic Programming for 4D Flight Trajectory Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kawser%20Ahmed">Kawser Ahmed</a>, <a href="https://publications.waset.org/abstracts/search?q=K.%20Bousson"> K. Bousson</a>, <a href="https://publications.waset.org/abstracts/search?q=Milca%20F.%20Coelho"> Milca F. Coelho</a> </p> <p class="card-text"><strong>Abstract:</strong></p> 4D flight trajectory optimization is one of the key ingredients to improve flight efficiency and to enhance the air traffic capacity in the current air traffic management (ATM). The present paper explores the iterative dynamic programming (IDP) as a potential numerical optimization method for 4D flight trajectory optimization. IDP is an iterative version of the Dynamic programming (DP) method. Due to the numerical framework, DP is very suitable to deal with nonlinear discrete dynamic systems. The 4D waypoint representation of the flight trajectory is similar to the discretization by a grid system; thus DP is a natural method to deal with the 4D flight trajectory optimization. However, the computational time and space complexity demanded by the DP is enormous due to the immense number of grid points required to find the optimum, which prevents the use of the DP in many practical high dimension problems. On the other hand, the IDP has shown potentials to deal successfully with high dimension optimal control problems even with a few numbers of grid points at each stage, which reduces the computational effort over the traditional DP approach. Although the IDP has been applied successfully in chemical engineering problems, IDP is yet to be validated in 4D flight trajectory optimization problems. In this paper, the IDP has been successfully used to generate minimum length 4D optimal trajectory avoiding any obstacle in its path, such as a no-fly zone or residential areas when flying in low altitude to reduce noise pollution. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=4D%20waypoint%20navigation" title="4D waypoint navigation">4D waypoint navigation</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20dynamic%20programming" title=" iterative dynamic programming"> iterative dynamic programming</a>, <a href="https://publications.waset.org/abstracts/search?q=obstacle%20avoidance" title=" obstacle avoidance"> obstacle avoidance</a>, <a href="https://publications.waset.org/abstracts/search?q=trajectory%20optimization" title=" trajectory optimization"> trajectory optimization</a> </p> <a href="https://publications.waset.org/abstracts/106496/iterative-dynamic-programming-for-4d-flight-trajectory-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/106496.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">162</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10917</span> Energy Management System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20Periyadharshini">S. Periyadharshini</a>, <a href="https://publications.waset.org/abstracts/search?q=K.%20Ramkumar"> K. Ramkumar</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Jayalalitha"> S. Jayalalitha</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20GuruPrasath"> M. GuruPrasath</a>, <a href="https://publications.waset.org/abstracts/search?q=R.%20Manikandan"> R. Manikandan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a formulation and solution for industrial load management and product grade problem. The formulation is created using linear programming technique thereby optimizing the electricity cost by scheduling the loads satisfying the process, storage, time zone and production constraints which will create an impact of reducing maximum demand and thereby reducing the electricity cost. Product grade problem is formulated using integer linear programming technique of optimization using lingo software and the results show that overall increase in profit margin. In this paper, time of use tariff is utilized and this technique will provide significant reductions in peak electricity consumption. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cement%20industries" title="cement industries">cement industries</a>, <a href="https://publications.waset.org/abstracts/search?q=integer%20programming" title=" integer programming"> integer programming</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20formulation" title=" optimal formulation"> optimal formulation</a>, <a href="https://publications.waset.org/abstracts/search?q=objective%20function" title=" objective function"> objective function</a>, <a href="https://publications.waset.org/abstracts/search?q=constraints" title=" constraints"> constraints</a> </p> <a href="https://publications.waset.org/abstracts/29389/energy-management-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/29389.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">593</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10916</span> Approximation of Convex Set by Compactly Semidefinite Representable Set</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Anusuya%20Ghosh">Anusuya Ghosh</a>, <a href="https://publications.waset.org/abstracts/search?q=Vishnu%20Narayanan"> Vishnu Narayanan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The approximation of convex set by semidefinite representable set plays an important role in semidefinite programming, especially in modern convex optimization. To optimize a linear function over a convex set is a hard problem. But optimizing the linear function over the semidefinite representable set which approximates the convex set is easy to solve as there exists numerous efficient algorithms to solve semidefinite programming problems. So, our approximation technique is significant in optimization. We develop a technique to approximate any closed convex set, say K by compactly semidefinite representable set. Further we prove that there exists a sequence of compactly semidefinite representable sets which give tighter approximation of the closed convex set, K gradually. We discuss about the convergence of the sequence of compactly semidefinite representable sets to closed convex set K. The recession cone of K and the recession cone of the compactly semidefinite representable set are equal. So, we say that the sequence of compactly semidefinite representable sets converge strongly to the closed convex set. Thus, this approximation technique is very useful development in semidefinite programming. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=semidefinite%20programming" title="semidefinite programming">semidefinite programming</a>, <a href="https://publications.waset.org/abstracts/search?q=semidefinite%20representable%20set" title=" semidefinite representable set"> semidefinite representable set</a>, <a href="https://publications.waset.org/abstracts/search?q=compactly%20semidefinite%20representable%20set" title=" compactly semidefinite representable set"> compactly semidefinite representable set</a>, <a href="https://publications.waset.org/abstracts/search?q=approximation" title=" approximation"> approximation</a> </p> <a href="https://publications.waset.org/abstracts/36914/approximation-of-convex-set-by-compactly-semidefinite-representable-set" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/36914.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">386</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10915</span> Use of Linear Programming for Optimal Production in a Production Line in Saudi Food Co.</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Qasim%20M.%20Kriri">Qasim M. Kriri</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Few Saudi Arabia production companies face financial profit issues until this moment. This work presents a linear integer programming model that solves a production problem of a Saudi Food Company in Saudi Arabia. An optimal solution to the above-mentioned problem is a Linear Programming solution. In this regard, the main purpose of this project is to maximize profit. Linear Programming Technique has been used to derive the maximum profit from production of natural juice at Saudi Food Co. The operations of production of the company were formulated and optimal results are found out by using Lindo Software that employed Sensitivity Analysis and Parametric linear programming in order develop Linear Programming. In addition, the parameter values are increased, then the values of the objective function will be increased. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=parameter%20linear%20programming" title="parameter linear programming">parameter linear programming</a>, <a href="https://publications.waset.org/abstracts/search?q=objective%20function" title=" objective function"> objective function</a>, <a href="https://publications.waset.org/abstracts/search?q=sensitivity%20analysis" title=" sensitivity analysis"> sensitivity analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=optimize%20profit" title=" optimize profit"> optimize profit</a> </p> <a href="https://publications.waset.org/abstracts/86104/use-of-linear-programming-for-optimal-production-in-a-production-line-in-saudi-food-co" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/86104.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">205</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10914</span> Dynamic Economic Load Dispatch Using Quadratic Programming: Application to Algerian Electrical Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20Graa">A. Graa</a>, <a href="https://publications.waset.org/abstracts/search?q=I.%20Ziane"> I. Ziane</a>, <a href="https://publications.waset.org/abstracts/search?q=F.%20Benhamida"> F. Benhamida</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Souag"> S. Souag</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a comparative analysis study of an efficient and reliable quadratic programming (QP) to solve economic load dispatch (ELD) problem with considering transmission losses in a power system. The proposed QP method takes care of different unit and system constraints to find optimal solution. To validate the effectiveness of the proposed QP solution, simulations have been performed using Algerian test system. Results obtained with the QP method have been compared with other existing relevant approaches available in literatures. Experimental results show a proficiency of the QP method over other existing techniques in terms of robustness and its optimal search. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=economic%20dispatch" title="economic dispatch">economic dispatch</a>, <a href="https://publications.waset.org/abstracts/search?q=quadratic%20programming" title=" quadratic programming"> quadratic programming</a>, <a href="https://publications.waset.org/abstracts/search?q=Algerian%20network" title=" Algerian network"> Algerian network</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20load" title=" dynamic load"> dynamic load</a> </p> <a href="https://publications.waset.org/abstracts/23032/dynamic-economic-load-dispatch-using-quadratic-programming-application-to-algerian-electrical-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/23032.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">565</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10913</span> Adaptive Optimal Controller for Uncertain Inverted Pendulum System: A Dynamic Programming Approach for Continuous Time System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Dao%20Phuong%20Nam">Dao Phuong Nam</a>, <a href="https://publications.waset.org/abstracts/search?q=Tran%20Van%20Tuyen"> Tran Van Tuyen</a>, <a href="https://publications.waset.org/abstracts/search?q=Do%20Trong%20Tan"> Do Trong Tan</a>, <a href="https://publications.waset.org/abstracts/search?q=Bui%20Minh%20Dinh"> Bui Minh Dinh</a>, <a href="https://publications.waset.org/abstracts/search?q=Nguyen%20Van%20Huong"> Nguyen Van Huong</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we investigate the adaptive optimal control law for continuous-time systems with input disturbances and unknown parameters. This paper extends previous works to obtain the robust control law of uncertain systems. Through theoretical analysis, an adaptive dynamic programming (ADP) based optimal control is proposed to stabilize the closed-loop system and ensure the convergence properties of proposed iterative algorithm. Moreover, the global asymptotic stability (GAS) for closed system is also analyzed. The theoretical analysis for continuous-time systems and simulation results demonstrate the performance of the proposed algorithm for an inverted pendulum system. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=approximate%2Fadaptive%20dynamic%20programming" title="approximate/adaptive dynamic programming">approximate/adaptive dynamic programming</a>, <a href="https://publications.waset.org/abstracts/search?q=ADP" title=" ADP"> ADP</a>, <a href="https://publications.waset.org/abstracts/search?q=adaptive%20optimal%20control%20law" title=" adaptive optimal control law"> adaptive optimal control law</a>, <a href="https://publications.waset.org/abstracts/search?q=input%20state%20stability" title=" input state stability"> input state stability</a>, <a href="https://publications.waset.org/abstracts/search?q=ISS" title=" ISS"> ISS</a>, <a href="https://publications.waset.org/abstracts/search?q=inverted%20pendulum" title=" inverted pendulum"> inverted pendulum</a> </p> <a href="https://publications.waset.org/abstracts/80356/adaptive-optimal-controller-for-uncertain-inverted-pendulum-system-a-dynamic-programming-approach-for-continuous-time-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/80356.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">194</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10912</span> Stochastic Programming and C-Somga: Animal Ration Formulation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Pratiksha%20Saxena">Pratiksha Saxena</a>, <a href="https://publications.waset.org/abstracts/search?q=Dipti%20Singh"> Dipti Singh</a>, <a href="https://publications.waset.org/abstracts/search?q=Neha%20Khanna"> Neha Khanna</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A self-organizing migrating genetic algorithm(C-SOMGA) is developed for animal diet formulation. This paper presents animal diet formulation using stochastic and genetic algorithm. Tri-objective models for cost minimization and shelf life maximization are developed. These objectives are achieved by combination of stochastic programming and C-SOMGA. Stochastic programming is used to introduce nutrient variability for animal diet. Self-organizing migrating genetic algorithm provides exact and quick solution and presents an innovative approach towards successful application of soft computing technique in the area of animal diet formulation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=animal%20feed%20ration" title="animal feed ration">animal feed ration</a>, <a href="https://publications.waset.org/abstracts/search?q=feed%20formulation" title=" feed formulation"> feed formulation</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20programming" title=" linear programming"> linear programming</a>, <a href="https://publications.waset.org/abstracts/search?q=stochastic%20programming" title=" stochastic programming"> stochastic programming</a>, <a href="https://publications.waset.org/abstracts/search?q=self-migrating%20genetic%20algorithm" title=" self-migrating genetic algorithm"> self-migrating genetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=C-SOMGA%20technique" title=" C-SOMGA technique"> C-SOMGA technique</a>, <a href="https://publications.waset.org/abstracts/search?q=shelf%20life%20maximization" title=" shelf life maximization"> shelf life maximization</a>, <a href="https://publications.waset.org/abstracts/search?q=cost%20minimization" title=" cost minimization"> cost minimization</a>, <a href="https://publications.waset.org/abstracts/search?q=nutrient%20maximization" title=" nutrient maximization"> nutrient maximization</a> </p> <a href="https://publications.waset.org/abstracts/35795/stochastic-programming-and-c-somga-animal-ration-formulation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/35795.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">442</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10911</span> Use the Null Space to Create Starting Point for Stochastic Programming</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ghussoun%20Al-Jeiroudi">Ghussoun Al-Jeiroudi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Stochastic programming is one of the powerful technique which is used to solve real-life problems. Hence, the data of real-life problems is subject to significant uncertainty. Uncertainty is well studied and modeled by stochastic programming. Each day, problems become bigger and bigger and the need for a tool, which does deal with large scale problems, increase. Interior point method is a perfect tool to solve such problems. Interior point method is widely employed to solve the programs, which arise from stochastic programming. It is an iterative technique, so it is required a starting point. Well design starting point plays an important role in improving the convergence speed. In this paper, we propose a starting point for interior point method for multistage stochastic programming. Usually, the optimal solution of stage k+1 is used as starting point for the stage k. This point has the advantage of being close to the solution of the current program. However, it has a disadvantage; it is not in the feasible region of the current program. So, we suggest to take this point and modifying it. That is by adding to it a vector in the null space of the matrix of the unchanged constraints because the solution will change only in the null space of this matrix. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=interior%20point%20methods" title="interior point methods">interior point methods</a>, <a href="https://publications.waset.org/abstracts/search?q=stochastic%20programming" title=" stochastic programming"> stochastic programming</a>, <a href="https://publications.waset.org/abstracts/search?q=null%20space" title=" null space"> null space</a>, <a href="https://publications.waset.org/abstracts/search?q=starting%20points" title=" starting points"> starting points</a> </p> <a href="https://publications.waset.org/abstracts/54185/use-the-null-space-to-create-starting-point-for-stochastic-programming" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/54185.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">418</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10910</span> A Common Automated Programming Platform for Knowledge Based Software Engineering</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ivan%20Stanev">Ivan Stanev</a>, <a href="https://publications.waset.org/abstracts/search?q=Maria%20Koleva"> Maria Koleva</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A common platform for automated programming (CPAP) is defined in details. Two versions of CPAP are described: Cloud-based (including the set of components for classic programming, and the set of components for combined programming) and KBASE based (including the set of components for automated programming, and the set of components for ontology programming). Four KBASE products (module for automated programming of robots, intelligent product manual, intelligent document display, and intelligent form generator) are analyzed and CPAP contributions to automated programming are presented. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=automated%20programming" title="automated programming">automated programming</a>, <a href="https://publications.waset.org/abstracts/search?q=cloud%20computing" title=" cloud computing"> cloud computing</a>, <a href="https://publications.waset.org/abstracts/search?q=knowledge%20based%20software%20engineering" title=" knowledge based software engineering"> knowledge based software engineering</a>, <a href="https://publications.waset.org/abstracts/search?q=service%20oriented%20architecture" title=" service oriented architecture"> service oriented architecture</a> </p> <a href="https://publications.waset.org/abstracts/40829/a-common-automated-programming-platform-for-knowledge-based-software-engineering" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/40829.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">343</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10909</span> A Survey of Grammar-Based Genetic Programming and Applications</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Matthew%20T.%20Wilson">Matthew T. Wilson</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper covers a selection of research utilizing grammar-based genetic programming, and illustrates how context-free grammar can be used to constrain genetic programming. It focuses heavily on grammatical evolution, one of the most popular variants of grammar-based genetic programming, and the way its operators and terminals are specialized and modified from those in genetic programming. A variety of implementations of grammatical evolution for general use are covered, as well as research each focused on using grammatical evolution or grammar-based genetic programming on a single application, or to solve a specific problem, including some of the classically considered genetic programming problems, such as the Santa Fe Trail. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=context-free%20grammar" title="context-free grammar">context-free grammar</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithms" title=" genetic algorithms"> genetic algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20programming" title=" genetic programming"> genetic programming</a>, <a href="https://publications.waset.org/abstracts/search?q=grammatical%20evolution" title=" grammatical evolution"> grammatical evolution</a> </p> <a href="https://publications.waset.org/abstracts/120249/a-survey-of-grammar-based-genetic-programming-and-applications" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/120249.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">187</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10908</span> Rainfall-Runoff Forecasting Utilizing Genetic Programming Technique</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ahmed%20Najah%20Ahmed%20Al-Mahfoodh">Ahmed Najah Ahmed Al-Mahfoodh</a>, <a href="https://publications.waset.org/abstracts/search?q=Ali%20Najah%20Ahmed%20%20Al-Mahfoodh"> Ali Najah Ahmed Al-Mahfoodh</a>, <a href="https://publications.waset.org/abstracts/search?q=Ahmed%20Al-Shafie"> Ahmed Al-Shafie</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this study, genetic programming (GP) technique has been investigated in prediction of set of rainfall-runoff data. To assess the effect of input parameters on the model, the sensitivity analysis was adopted. To evaluate the performance of the proposed model, three statistical indexes were used, namely; Correlation Coefficient (CC), Mean Square Error (MSE) and Correlation of Efficiency (CE). The principle aim of this study is to develop a computationally efficient and robust approach for predict of rainfall-runoff which could reduce the cost and labour for measuring these parameters. This research concentrates on the Johor River in Johor State, Malaysia. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=genetic%20programming" title="genetic programming">genetic programming</a>, <a href="https://publications.waset.org/abstracts/search?q=prediction" title=" prediction"> prediction</a>, <a href="https://publications.waset.org/abstracts/search?q=rainfall-runoff" title=" rainfall-runoff"> rainfall-runoff</a>, <a href="https://publications.waset.org/abstracts/search?q=Malaysia" title=" Malaysia"> Malaysia</a> </p> <a href="https://publications.waset.org/abstracts/66110/rainfall-runoff-forecasting-utilizing-genetic-programming-technique" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/66110.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">481</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10907</span> Apply Commitment Method in Power System to Minimize the Fuel Cost</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20Shaban">Mohamed Shaban</a>, <a href="https://publications.waset.org/abstracts/search?q=Adel%20Yahya"> Adel Yahya</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The goal of this paper study is to schedule the power generation units to minimize fuel consumption cost based on a model that solves unit commitment problems. This can be done by utilizing forward dynamic programming method to determine the most economic scheduling of generating units. The model was applied to a power station, which consists of four generating units. The obtained results show that the applications of forward dynamic programming method offer a substantial reduction in fuel consumption cost. The fuel consumption cost has been reduced from $116,326 to $102,181 within a 24-hour period. This means saving about 12.16 % of fuel consumption cost. The study emphasizes the importance of applying modeling schedule programs to the operation of power generation units. As a consequence less consumption of fuel, less loss of power and less pollution <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=unit%20commitment" title="unit commitment">unit commitment</a>, <a href="https://publications.waset.org/abstracts/search?q=forward%20dynamic" title=" forward dynamic"> forward dynamic</a>, <a href="https://publications.waset.org/abstracts/search?q=fuel%20cost" title=" fuel cost"> fuel cost</a>, <a href="https://publications.waset.org/abstracts/search?q=programming" title=" programming"> programming</a>, <a href="https://publications.waset.org/abstracts/search?q=generation%20scheduling" title=" generation scheduling"> generation scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=operation%20cost" title=" operation cost"> operation cost</a>, <a href="https://publications.waset.org/abstracts/search?q=power%20system" title=" power system"> power system</a>, <a href="https://publications.waset.org/abstracts/search?q=generating%20units" title=" generating units"> generating units</a> </p> <a href="https://publications.waset.org/abstracts/33870/apply-commitment-method-in-power-system-to-minimize-the-fuel-cost" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/33870.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">611</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10906</span> Cutting Plane Methods for Integer Programming: NAZ Cut and Its Variations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20Bari">A. Bari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Integer programming is a branch of mathematical programming techniques in operations research in which some or all of the variables are required to be integer valued. Various cuts have been used to solve these problems. We have also developed cuts known as NAZ cut & A-T cut to solve the integer programming problems. These cuts are used to reduce the feasible region and then reaching the optimal solution in minimum number of steps. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Integer%20Programming" title="Integer Programming">Integer Programming</a>, <a href="https://publications.waset.org/abstracts/search?q=NAZ%20cut" title=" NAZ cut"> NAZ cut</a>, <a href="https://publications.waset.org/abstracts/search?q=A-T%20cut" title=" A-T cut"> A-T cut</a>, <a href="https://publications.waset.org/abstracts/search?q=Cutting%20plane%20method" title=" Cutting plane method"> Cutting plane method</a> </p> <a href="https://publications.waset.org/abstracts/8763/cutting-plane-methods-for-integer-programming-naz-cut-and-its-variations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/8763.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">364</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10905</span> Optimization of Agricultural Water Demand Using a Hybrid Model of Dynamic Programming and Neural Networks: A Case Study of Algeria</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Boudjerda">M. Boudjerda</a>, <a href="https://publications.waset.org/abstracts/search?q=B.%20Touaibia"> B. Touaibia</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20K.%20Mihoubi"> M. K. Mihoubi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In Algeria agricultural irrigation is the primary water consuming sector followed by the domestic and industrial sectors. Economic development in the last decade has weighed heavily on water resources which are relatively limited and gradually decreasing to the detriment of agriculture. The research presented in this paper focuses on the optimization of irrigation water demand. Dynamic Programming-Neural Network (DPNN) method is applied to investigate reservoir optimization. The optimal operation rule is formulated to minimize the gap between water release and water irrigation demand. As a case study, Foum El-Gherza dam’s reservoir system in south of Algeria has been selected to examine our proposed optimization model. The application of DPNN method allowed increasing the satisfaction rate (SR) from 12.32% to 55%. In addition, the operation rule generated showed more reliable and resilience operation for the examined case study. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=water%20management" title="water management">water management</a>, <a href="https://publications.waset.org/abstracts/search?q=agricultural%20demand" title=" agricultural demand"> agricultural demand</a>, <a href="https://publications.waset.org/abstracts/search?q=dam%20and%20reservoir%20operation" title=" dam and reservoir operation"> dam and reservoir operation</a>, <a href="https://publications.waset.org/abstracts/search?q=Foum%20el-Gherza%20dam" title=" Foum el-Gherza dam"> Foum el-Gherza dam</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20programming" title=" dynamic programming"> dynamic programming</a>, <a href="https://publications.waset.org/abstracts/search?q=artificial%20neural%20network" title=" artificial neural network"> artificial neural network</a> </p> <a href="https://publications.waset.org/abstracts/117003/optimization-of-agricultural-water-demand-using-a-hybrid-model-of-dynamic-programming-and-neural-networks-a-case-study-of-algeria" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/117003.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">115</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10904</span> Load Forecasting Using Neural Network Integrated with Economic Dispatch Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mariyam%20Arif">Mariyam Arif</a>, <a href="https://publications.waset.org/abstracts/search?q=Ye%20Liu"> Ye Liu</a>, <a href="https://publications.waset.org/abstracts/search?q=Israr%20Ul%20Haq"> Israr Ul Haq</a>, <a href="https://publications.waset.org/abstracts/search?q=Ahsan%20Ashfaq"> Ahsan Ashfaq</a> </p> <p class="card-text"><strong>Abstract:</strong></p> High cost of fossil fuels and intensifying installations of alternate energy generation sources are intimidating main challenges in power systems. Making accurate load forecasting an important and challenging task for optimal energy planning and management at both distribution and generation side. There are many techniques to forecast load but each technique comes with its own limitation and requires data to accurately predict the forecast load. Artificial Neural Network (ANN) is one such technique to efficiently forecast the load. Comparison between two different ranges of input datasets has been applied to dynamic ANN technique using MATLAB Neural Network Toolbox. It has been observed that selection of input data on training of a network has significant effects on forecasted results. Day-wise input data forecasted the load accurately as compared to year-wise input data. The forecasted load is then distributed among the six generators by using the linear programming to get the optimal point of generation. The algorithm is then verified by comparing the results of each generator with their respective generation limits. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=artificial%20neural%20networks" title="artificial neural networks">artificial neural networks</a>, <a href="https://publications.waset.org/abstracts/search?q=demand-side%20management" title=" demand-side management"> demand-side management</a>, <a href="https://publications.waset.org/abstracts/search?q=economic%20dispatch" title=" economic dispatch"> economic dispatch</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20programming" title=" linear programming"> linear programming</a>, <a href="https://publications.waset.org/abstracts/search?q=power%20generation%20dispatch" title=" power generation dispatch"> power generation dispatch</a> </p> <a href="https://publications.waset.org/abstracts/100218/load-forecasting-using-neural-network-integrated-with-economic-dispatch-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/100218.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">189</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10903</span> Examining Relationship between Programming Performance, Programming Self Efficacy and Math Success </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mustafa%20Ekici">Mustafa Ekici</a>, <a href="https://publications.waset.org/abstracts/search?q=Sacide%20G%C3%BCzin%20Mazman"> Sacide Güzin Mazman </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Programming is the one of ability in computer science fields which is generally perceived difficult by students and various individual differences have been implicated in that ability success. Although several factors that affect programming ability have been identified over the years, there is not still a full understanding of why some students learn to program easily and quickly while others find it complex and difficult. Programming self-efficacy and mathematic success are two of those essential individual differences which are handled as having important effect on the programming success. This study aimed to identify the relationship between programming performance, programming self efficacy and mathematics success. The study group is consisted of 96 undergraduates from Department of Econometrics of Uşak University. 38 (39,58%) of the participants are female while 58 (60,41%) of them are male. Study was conducted in the programming-I course during 2014-2015 fall term. Data collection tools are comprised of programming course final grades, programming self efficacy scale and a mathematics achievement test. Data was analyzed through correlation analysis. The result of study will be reported in the full text of the study. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=programming%20performance" title="programming performance">programming performance</a>, <a href="https://publications.waset.org/abstracts/search?q=self%20efficacy" title=" self efficacy"> self efficacy</a>, <a href="https://publications.waset.org/abstracts/search?q=mathematic%20success" title=" mathematic success"> mathematic success</a>, <a href="https://publications.waset.org/abstracts/search?q=computer%20science" title=" computer science"> computer science</a> </p> <a href="https://publications.waset.org/abstracts/18162/examining-relationship-between-programming-performance-programming-self-efficacy-and-math-success" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/18162.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">502</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10902</span> Dynamic Store Procedures in Database</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Muhammet%20Dursun%20Kaya">Muhammet Dursun Kaya</a>, <a href="https://publications.waset.org/abstracts/search?q=Hasan%20Asil"> Hasan Asil</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In recent years, different methods have been proposed to optimize question processing in database. Although different methods have been proposed to optimize the query, but the problem which exists here is that most of these methods destroy the query execution plan after executing the query. This research attempts to solve the above problem by using a combination of methods of communicating with the database (the present questions in the programming code and using store procedures) and making query processing adaptive in database, and proposing a new approach for optimization of query processing by introducing the idea of dynamic store procedures. This research creates dynamic store procedures in the database according to the proposed algorithm. This method has been tested on applied software and results shows a significant improvement in reducing the query processing time and also reducing the workload of DBMS. Other advantages of this algorithm include: making the programming environment a single environment, eliminating the parametric limitations of the stored procedures in the database, making the stored procedures in the database dynamic, etc. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=relational%20database" title="relational database">relational database</a>, <a href="https://publications.waset.org/abstracts/search?q=agent" title=" agent"> agent</a>, <a href="https://publications.waset.org/abstracts/search?q=query%20processing" title=" query processing"> query processing</a>, <a href="https://publications.waset.org/abstracts/search?q=adaptable" title=" adaptable"> adaptable</a>, <a href="https://publications.waset.org/abstracts/search?q=communication%20with%20the%20database" title=" communication with the database"> communication with the database</a> </p> <a href="https://publications.waset.org/abstracts/35023/dynamic-store-procedures-in-database" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/35023.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">371</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10901</span> An Optimization Model for Maximum Clique Problem Based on Semidefinite Programming</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Derkaoui%20Orkia">Derkaoui Orkia</a>, <a href="https://publications.waset.org/abstracts/search?q=Lehireche%20Ahmed"> Lehireche Ahmed</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The topic of this article is to exploring the potentialities of a powerful optimization technique, namely Semidefinite Programming, for solving NP-hard problems. This approach provides tight relaxations of combinatorial and quadratic problems. In this work, we solve the maximum clique problem using this relaxation. The clique problem is the computational problem of finding cliques in a graph. It is widely acknowledged for its many applications in real-world problems. The numerical results show that it is possible to find a maximum clique in polynomial time, using an algorithm based on semidefinite programming. We implement a primal-dual interior points algorithm to solve this problem based on semidefinite programming. The semidefinite relaxation of this problem can be solved in polynomial time. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=semidefinite%20programming" title="semidefinite programming">semidefinite programming</a>, <a href="https://publications.waset.org/abstracts/search?q=maximum%20clique%20problem" title=" maximum clique problem"> maximum clique problem</a>, <a href="https://publications.waset.org/abstracts/search?q=primal-dual%20interior%20point%20method" title=" primal-dual interior point method"> primal-dual interior point method</a>, <a href="https://publications.waset.org/abstracts/search?q=relaxation" title=" relaxation"> relaxation</a> </p> <a href="https://publications.waset.org/abstracts/73224/an-optimization-model-for-maximum-clique-problem-based-on-semidefinite-programming" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/73224.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">222</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10900</span> Optimization and Simulation Models Applied in Engineering Planning and Management</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abiodun%20Ladanu%20Ajala">Abiodun Ladanu Ajala</a>, <a href="https://publications.waset.org/abstracts/search?q=Wuyi%20Oke"> Wuyi Oke</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Mathematical simulation and optimization models packaged within interactive computer programs provide a common way for planners and managers to predict the behaviour of any proposed water resources system design or management policy before it is implemented. Modeling presents a principal technique of predicting the behaviour of the proposed infrastructural designs or management policies. Models can be developed and used to help identify specific alternative plans that best meet those objectives. This study discusses various types of models, their development, architecture, data requirements, and applications in the field of engineering. It also outlines the advantages and limitations of each the optimization and simulation models presented. The techniques explored in this review include; dynamic programming, linear programming, fuzzy optimization, evolutionary algorithms and finally artificial intelligence techniques. Previous studies carried out using some of the techniques mentioned above were reviewed, and most of the results from different researches showed that indeed optimization and simulation provides viable alternatives and predictions which form a basis for decision making in building engineering structures and also in engineering planning and management. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=linear%20programming" title="linear programming">linear programming</a>, <a href="https://publications.waset.org/abstracts/search?q=mutation" title=" mutation"> mutation</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=simulation" title=" simulation"> simulation</a> </p> <a href="https://publications.waset.org/abstracts/67525/optimization-and-simulation-models-applied-in-engineering-planning-and-management" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/67525.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">589</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10899</span> Application of De Novo Programming Approach for Optimizing the Business Process</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Z.%20Babic">Z. Babic</a>, <a href="https://publications.waset.org/abstracts/search?q=I.%20Veza"> I. Veza</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Balic"> A. Balic</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Crnjac"> M. Crnjac</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The linear programming model is sometimes difficult to apply in real business situations due to its assumption of proportionality. This paper shows an example of how to use De Novo programming approach instead of linear programming. In the De Novo programming, resources are not fixed like in linear programming but resource quantities depend only on available budget. Budget is a new, important element of the De Novo approach. Two different production situations are presented: increasing costs and quantity discounts of raw materials. The focus of this paper is on advantages of the De Novo approach in the optimization of production plan for production company which produces souvenirs made from famous stone from the island of Brac, one of the greatest islands from Croatia. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=business%20process" title="business process">business process</a>, <a href="https://publications.waset.org/abstracts/search?q=De%20Novo%20programming" title=" De Novo programming"> De Novo programming</a>, <a href="https://publications.waset.org/abstracts/search?q=optimizing" title=" optimizing"> optimizing</a>, <a href="https://publications.waset.org/abstracts/search?q=production" title=" production"> production</a> </p> <a href="https://publications.waset.org/abstracts/80556/application-of-de-novo-programming-approach-for-optimizing-the-business-process" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/80556.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">222</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10898</span> A Dynamic Solution Approach for Heart Disease Prediction</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Walid%20Moudani">Walid Moudani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The healthcare environment is generally perceived as being information rich yet knowledge poor. However, there is a lack of effective analysis tools to discover hidden relationships and trends in data. In fact, valuable knowledge can be discovered from application of data mining techniques in healthcare system. In this study, a proficient methodology for the extraction of significant patterns from the coronary heart disease warehouses for heart attack prediction, which unfortunately continues to be a leading cause of mortality in the whole world, has been presented. For this purpose, we propose to enumerate dynamically the optimal subsets of the reduced features of high interest by using rough sets technique associated to dynamic programming. Therefore, we propose to validate the classification using Random Forest (RF) decision tree to identify the risky heart disease cases. This work is based on a large amount of data collected from several clinical institutions based on the medical profile of patient. Moreover, the experts’ knowledge in this field has been taken into consideration in order to define the disease, its risk factors, and to establish significant knowledge relationships among the medical factors. A computer-aided system is developed for this purpose based on a population of 525 adults. The performance of the proposed model is analyzed and evaluated based on set of benchmark techniques applied in this classification problem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=multi-classifier%20decisions%20tree" title="multi-classifier decisions tree">multi-classifier decisions tree</a>, <a href="https://publications.waset.org/abstracts/search?q=features%20reduction" title=" features reduction"> features reduction</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20programming" title=" dynamic programming"> dynamic programming</a>, <a href="https://publications.waset.org/abstracts/search?q=rough%20sets" title=" rough sets"> rough sets</a> </p> <a href="https://publications.waset.org/abstracts/7975/a-dynamic-solution-approach-for-heart-disease-prediction" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/7975.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">410</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10897</span> A Fuzzy Programming Approach for Solving Intuitionistic Fuzzy Linear Fractional Programming Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sujeet%20Kumar%20Singh">Sujeet Kumar Singh</a>, <a href="https://publications.waset.org/abstracts/search?q=Shiv%20Prasad%20Yadav"> Shiv Prasad Yadav</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper develops an approach for solving intuitionistic fuzzy linear fractional programming (IFLFP) problem where the cost of the objective function, the resources, and the technological coefficients are triangular intuitionistic fuzzy numbers. Here, the IFLFP problem is transformed into an equivalent crisp multi-objective linear fractional programming (MOLFP) problem. By using fuzzy mathematical programming approach the transformed MOLFP problem is reduced into a single objective linear programming (LP) problem. The proposed procedure is illustrated through a numerical example. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=triangular%20intuitionistic%20fuzzy%20number" title="triangular intuitionistic fuzzy number">triangular intuitionistic fuzzy number</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20programming%20problem" title=" linear programming problem"> linear programming problem</a>, <a href="https://publications.waset.org/abstracts/search?q=multi%20objective%20linear%20programming%20problem" title=" multi objective linear programming problem"> multi objective linear programming problem</a>, <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20mathematical%20programming" title=" fuzzy mathematical programming"> fuzzy mathematical programming</a>, <a href="https://publications.waset.org/abstracts/search?q=membership%20function" title=" membership function"> membership function</a> </p> <a href="https://publications.waset.org/abstracts/16411/a-fuzzy-programming-approach-for-solving-intuitionistic-fuzzy-linear-fractional-programming-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/16411.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">566</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10896</span> Software Transactional Memory in a Dynamic Programming Language at Virtual Machine Level</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Szu-Kai%20Hsu">Szu-Kai Hsu</a>, <a href="https://publications.waset.org/abstracts/search?q=Po-Ching%20Lin"> Po-Ching Lin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> As more and more multi-core processors emerge, traditional sequential programming paradigm no longer suffice. Yet only few modern dynamic programming languages can leverage such advantage. Ruby, for example, despite its wide adoption, only includes threads as a simple parallel primitive. The global virtual machine lock of official Ruby runtime makes it impossible to exploit full parallelism. Though various alternative Ruby implementations do eliminate the global virtual machine lock, they only provide developers dated locking mechanism for data synchronization. However, traditional locking mechanism error-prone by nature. Software Transactional Memory is one of the promising alternatives among others. This paper introduces a new virtual machine: GobiesVM to provide a native software transactional memory based solution for dynamic programming languages to exploit parallelism. We also proposed a simplified variation of Transactional Locking II algorithm. The empirical results of our experiments show that support of STM at virtual machine level enables developers to write straightforward code without compromising parallelism or sacrificing thread safety. Existing source code only requires minimal or even none modi cation, which allows developers to easily switch their legacy codebase to a parallel environment. The performance evaluations of GobiesVM also indicate the difference between sequential and parallel execution is significant. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=global%20interpreter%20lock" title="global interpreter lock">global interpreter lock</a>, <a href="https://publications.waset.org/abstracts/search?q=ruby" title=" ruby"> ruby</a>, <a href="https://publications.waset.org/abstracts/search?q=software%20transactional%20memory" title=" software transactional memory"> software transactional memory</a>, <a href="https://publications.waset.org/abstracts/search?q=virtual%20machine" title=" virtual machine"> virtual machine</a> </p> <a href="https://publications.waset.org/abstracts/17152/software-transactional-memory-in-a-dynamic-programming-language-at-virtual-machine-level" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/17152.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">285</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10895</span> Genetic Algorithm and Multi-Parametric Programming Based Cascade Control System for Unmanned Aerial Vehicles</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Dao%20Phuong%20Nam">Dao Phuong Nam</a>, <a href="https://publications.waset.org/abstracts/search?q=Do%20Trong%20Tan"> Do Trong Tan</a>, <a href="https://publications.waset.org/abstracts/search?q=Pham%20Tam%20Thanh"> Pham Tam Thanh</a>, <a href="https://publications.waset.org/abstracts/search?q=Le%20Duy%20Tung"> Le Duy Tung</a>, <a href="https://publications.waset.org/abstracts/search?q=Tran%20Hoang%20Anh"> Tran Hoang Anh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper considers the problem of cascade control system for unmanned aerial vehicles (UAVs). Due to the complicated modelling technique of UAV, it is necessary to separate them into two subsystems. The proposed cascade control structure is a hierarchical scheme including a robust control for inner subsystem based on H infinity theory and trajectory generator using genetic algorithm (GA), outer loop control law based on multi-parametric programming (MPP) technique to overcome the disadvantage of a big amount of calculations. Simulation results are presented to show that the equivalent path has been found and obtained by proposed cascade control scheme. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithm" title="genetic algorithm">genetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=GA" title=" GA"> GA</a>, <a href="https://publications.waset.org/abstracts/search?q=H%20infinity" title=" H infinity"> H infinity</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-parametric%20programming" title=" multi-parametric programming"> multi-parametric programming</a>, <a href="https://publications.waset.org/abstracts/search?q=MPP" title=" MPP"> MPP</a>, <a href="https://publications.waset.org/abstracts/search?q=unmanned%20aerial%20vehicles" title=" unmanned aerial vehicles"> unmanned aerial vehicles</a>, <a href="https://publications.waset.org/abstracts/search?q=UAVs" title=" UAVs"> UAVs</a> </p> <a href="https://publications.waset.org/abstracts/81434/genetic-algorithm-and-multi-parametric-programming-based-cascade-control-system-for-unmanned-aerial-vehicles" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/81434.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">212</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">10894</span> Sensitivity Analysis in Fuzzy Linear Programming Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20H.%20Nasseri">S. H. Nasseri</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Ebrahimnejad"> A. Ebrahimnejad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Fuzzy set theory has been applied to many fields, such as operations research, control theory, and management sciences. In this paper, we consider two classes of fuzzy linear programming (FLP) problems: Fuzzy number linear programming and linear programming with trapezoidal fuzzy variables problems. We state our recently established results and develop fuzzy primal simplex algorithms for solving these problems. Finally, we give illustrative examples. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20linear%20programming" title="fuzzy linear programming">fuzzy linear programming</a>, <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20numbers" title=" fuzzy numbers"> fuzzy numbers</a>, <a href="https://publications.waset.org/abstracts/search?q=duality" title=" duality"> duality</a>, <a href="https://publications.waset.org/abstracts/search?q=sensitivity%20analysis" title=" sensitivity analysis"> sensitivity analysis</a> </p> <a href="https://publications.waset.org/abstracts/16916/sensitivity-analysis-in-fuzzy-linear-programming-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/16916.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">565</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=dynamic%20programming%20technique&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=dynamic%20programming%20technique&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=dynamic%20programming%20technique&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=dynamic%20programming%20technique&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=dynamic%20programming%20technique&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=dynamic%20programming%20technique&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=dynamic%20programming%20technique&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=dynamic%20programming%20technique&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=dynamic%20programming%20technique&page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=dynamic%20programming%20technique&page=364">364</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=dynamic%20programming%20technique&page=365">365</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=dynamic%20programming%20technique&page=2" rel="next">&rsaquo;</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">© 2024 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>