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: nonlinear programming technique</title> <meta name="description" content="Search results for: nonlinear programming technique"> <meta name="keywords" content="nonlinear 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="nonlinear 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="nonlinear 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> 8533</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: nonlinear 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">8533</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">332</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">8532</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">8531</span> Duality in Multiobjective Nonlinear Programming under Generalized Second Order (F, b, φ, ρ, θ)− Univex Functions</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Meraj%20Ali%20Khan">Meraj Ali Khan</a>, <a href="https://publications.waset.org/abstracts/search?q=Falleh%20R.%20Al-Solamy"> Falleh R. Al-Solamy</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the present paper, second order duality for multiobjective nonlinear programming are investigated under the second order generalized (F, b, φ, ρ, θ)− univex functions. The weak, strong and converse duality theorems are proved. Further, we also illustrated an example of (F, b, φ, ρ, θ)− univex functions. Results obtained in this paper extend some previously known results of multiobjective nonlinear programming in the literature. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=duality" title="duality">duality</a>, <a href="https://publications.waset.org/abstracts/search?q=multiobjective%20programming" title=" multiobjective programming"> multiobjective programming</a>, <a href="https://publications.waset.org/abstracts/search?q=univex%20functions" title=" univex functions"> univex functions</a>, <a href="https://publications.waset.org/abstracts/search?q=univex" title=" univex"> univex</a> </p> <a href="https://publications.waset.org/abstracts/4320/duality-in-multiobjective-nonlinear-programming-under-generalized-second-order-f-b-f-r-th-univex-functions" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/4320.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">354</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">8530</span> Solution of Nonlinear Fractional Programming Problem with Bounded Parameters</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mrinal%20Jana">Mrinal Jana</a>, <a href="https://publications.waset.org/abstracts/search?q=Geetanjali%20Panda"> Geetanjali Panda</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper a methodology is developed to solve a nonlinear fractional programming problem in which the coefficients of the objective function and constraints are interval parameters. This model is transformed into a general optimization problem and relation between the original problem and the transformed problem is established. Finally the proposed methodology is illustrated through a numerical example. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fractional%20programming" title="fractional programming">fractional programming</a>, <a href="https://publications.waset.org/abstracts/search?q=interval%20valued%20function" title=" interval valued function"> interval valued function</a>, <a href="https://publications.waset.org/abstracts/search?q=interval%20inequalities" title=" interval inequalities"> interval inequalities</a>, <a href="https://publications.waset.org/abstracts/search?q=partial%20order%20relation" title=" partial order relation"> partial order relation</a> </p> <a href="https://publications.waset.org/abstracts/22261/solution-of-nonlinear-fractional-programming-problem-with-bounded-parameters" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/22261.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">519</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">8529</span> Optimization of Economic Order Quantity of Multi-Item Inventory Control Problem through Nonlinear Programming Technique</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Prabha%20Rohatgi">Prabha Rohatgi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> To obtain an efficient control over a huge amount of inventory of drugs in pharmacy department of any hospital, generally, the medicines are categorized on the basis of their cost ‘ABC’ (Always Better Control), first and then categorize on the basis of their criticality ‘VED’ (Vital, Essential, desirable) for prioritization. About one-third of the annual expenditure of a hospital is spent on medicines. To minimize the inventory investment, the hospital management may like to keep the medicines inventory low, as medicines are perishable items. The main aim of each and every hospital is to provide better services to the patients under certain limited resources. To achieve the satisfactory level of health care services to outdoor patients, a hospital has to keep eye on the wastage of medicines because expiry date of medicines causes a great loss of money though it was limited and allocated for a particular period of time. The objectives of this study are to identify the categories of medicines requiring incentive managerial control. In this paper, to minimize the total inventory cost and the cost associated with the wastage of money due to expiry of medicines, an inventory control model is used as an estimation tool and then nonlinear programming technique is used under limited budget and fixed number of orders to be placed in a limited time period. Numerical computations have been given and shown that by using scientific methods in hospital services, we can give more effective way of inventory management under limited resources and can provide better health care services. The secondary data has been collected from a hospital to give empirical evidence. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ABC-VED%20inventory%20classification" title="ABC-VED inventory classification">ABC-VED inventory classification</a>, <a href="https://publications.waset.org/abstracts/search?q=multi%20item%20inventory%20problem" title=" multi item inventory problem"> multi item inventory problem</a>, <a href="https://publications.waset.org/abstracts/search?q=nonlinear%20programming%20technique" title=" nonlinear programming technique"> nonlinear programming technique</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization%20of%20EOQ" title=" optimization of EOQ"> optimization of EOQ</a> </p> <a href="https://publications.waset.org/abstracts/68645/optimization-of-economic-order-quantity-of-multi-item-inventory-control-problem-through-nonlinear-programming-technique" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/68645.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">255</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">8528</span> A General Iterative Nonlinear Programming Method to Synthesize Heat Exchanger Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rupu%20Yang">Rupu Yang</a>, <a href="https://publications.waset.org/abstracts/search?q=Cong%20Toan%20Tran"> Cong Toan Tran</a>, <a href="https://publications.waset.org/abstracts/search?q=Assaad%20Zoughaib"> Assaad Zoughaib</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The work provides an iterative nonlinear programming method to synthesize a heat exchanger network by manipulating the trade-offs between the heat load of process heat exchangers (HEs) and utilities. We consider for the synthesis problem two cases, the first one without fixed cost for HEs, and the second one with fixed cost. For the no fixed cost problem, the nonlinear programming (NLP) model with all the potential HEs is optimized to obtain the global optimum. For the case with fixed cost, the NLP model is iterated through adding/removing HEs. The method was applied in five case studies and illustrated quite well effectiveness. Among which, the approach reaches the lowest TAC (2,904,026$/year) compared with the best record for the famous Aromatic plants problem. It also locates a slightly better design than records in literature for a 10 streams case without fixed cost with only 1/9 computational time. Moreover, compared to the traditional mixed-integer nonlinear programming approach, the iterative NLP method opens a possibility to consider constraints (such as controllability or dynamic performances) that require knowing the structure of the network to be calculated. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=heat%20exchanger%20network" title="heat exchanger network">heat exchanger network</a>, <a href="https://publications.waset.org/abstracts/search?q=synthesis" title=" synthesis"> synthesis</a>, <a href="https://publications.waset.org/abstracts/search?q=NLP" title=" NLP"> NLP</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a> </p> <a href="https://publications.waset.org/abstracts/138480/a-general-iterative-nonlinear-programming-method-to-synthesize-heat-exchanger-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/138480.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">8527</span> Study on Optimal Control Strategy of PM2.5 in Wuhan, China</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Qiuling%20Xie">Qiuling Xie</a>, <a href="https://publications.waset.org/abstracts/search?q=Shanliang%20Zhu"> Shanliang Zhu</a>, <a href="https://publications.waset.org/abstracts/search?q=Zongdi%20Sun"> Zongdi Sun</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we analyzed the correlation relationship among PM2.5 from other five Air Quality Indices (AQIs) based on the grey relational degree, and built a multivariate nonlinear regression equation model of PM2.5 and the five monitoring indexes. For the optimal control problem of PM2.5, we took the partial large Cauchy distribution of membership equation as satisfaction function. We established a nonlinear programming model with the goal of maximum performance to price ratio. And the optimal control scheme is given. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=grey%20relational%20degree" title="grey relational degree">grey relational degree</a>, <a href="https://publications.waset.org/abstracts/search?q=multiple%20linear%20regression" title=" multiple linear regression"> multiple linear regression</a>, <a href="https://publications.waset.org/abstracts/search?q=membership%20function" title=" membership function"> membership function</a>, <a href="https://publications.waset.org/abstracts/search?q=nonlinear%20programming" title=" nonlinear programming"> nonlinear programming</a> </p> <a href="https://publications.waset.org/abstracts/54538/study-on-optimal-control-strategy-of-pm25-in-wuhan-china" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/54538.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">299</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">8526</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">454</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">8525</span> Numerical Solution of Portfolio Selecting Semi-Infinite Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Alina%20Fedossova">Alina Fedossova</a>, <a href="https://publications.waset.org/abstracts/search?q=Jose%20Jorge%20Sierra%20Molina"> Jose Jorge Sierra Molina </a> </p> <p class="card-text"><strong>Abstract:</strong></p> SIP problems are part of non-classical optimization. There are problems in which the number of variables is finite, and the number of constraints is infinite. These are semi-infinite programming problems. Most algorithms for semi-infinite programming problems reduce the semi-infinite problem to a finite one and solve it by classical methods of linear or nonlinear programming. Typically, any of the constraints or the objective function is nonlinear, so the problem often involves nonlinear programming. An investment portfolio is a set of instruments used to reach the specific purposes of investors. The risk of the entire portfolio may be less than the risks of individual investment of portfolio. For example, we could make an investment of M euros in N shares for a specified period. Let yi> 0, the return on money invested in stock i for each dollar since the end of the period (i = 1, ..., N). The logical goal here is to determine the amount xi to be invested in stock i, i = 1, ..., N, such that we maximize the period at the end of ytx value, where x = (x1, ..., xn) and y = (y1, ..., yn). For us the optimal portfolio means the best portfolio in the ratio "risk-return" to the investor portfolio that meets your goals and risk ways. Therefore, investment goals and risk appetite are the factors that influence the choice of appropriate portfolio of assets. The investment returns are uncertain. Thus we have a semi-infinite programming problem. We solve a semi-infinite optimization problem of portfolio selection using the outer approximations methods. This approach can be considered as a developed Eaves-Zangwill method applying the multi-start technique in all of the iterations for the search of relevant constraints' parameters. The stochastic outer approximations method, successfully applied previously for robotics problems, Chebyshev approximation problems, air pollution and others, is based on the optimal criteria of quasi-optimal functions. As a result we obtain mathematical model and the optimal investment portfolio when yields are not clear from the beginning. Finally, we apply this algorithm to a specific case of a Colombian bank. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=outer%20approximation%20methods" title="outer approximation methods">outer approximation methods</a>, <a href="https://publications.waset.org/abstracts/search?q=portfolio%20problem" title=" portfolio problem"> portfolio problem</a>, <a href="https://publications.waset.org/abstracts/search?q=semi-infinite%20programming" title=" semi-infinite programming"> semi-infinite programming</a>, <a href="https://publications.waset.org/abstracts/search?q=numerial%20solution" title=" numerial solution"> numerial solution</a> </p> <a href="https://publications.waset.org/abstracts/29163/numerical-solution-of-portfolio-selecting-semi-infinite-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/29163.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">309</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">8524</span> A New Nonlinear State-Space Model and Its Application</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abdullah%20Eqal%20Al%20Mazrooei">Abdullah Eqal Al Mazrooei</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this work, a new nonlinear model will be introduced. The model is in the state-space form. The nonlinearity of this model is in the state equation where the state vector is multiplied by its self. This technique makes our model generalizes many famous models as Lotka-Volterra model and Lorenz model which have many applications in the real life. We will apply our new model to estimate the wind speed by using a new nonlinear estimator which suitable to work with our model. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=nonlinear%20systems" title="nonlinear systems">nonlinear systems</a>, <a href="https://publications.waset.org/abstracts/search?q=state-space%20model" title=" state-space model"> state-space model</a>, <a href="https://publications.waset.org/abstracts/search?q=Kronecker%20product" title=" Kronecker product"> Kronecker product</a>, <a href="https://publications.waset.org/abstracts/search?q=nonlinear%20estimator" title=" nonlinear estimator"> nonlinear estimator</a> </p> <a href="https://publications.waset.org/abstracts/34407/a-new-nonlinear-state-space-model-and-its-application" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/34407.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">691</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">8523</span> Three-Dimensional Optimal Path Planning of a Flying Robot for Terrain Following/Terrain Avoidance</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Amirreza%20Kosari">Amirreza Kosari</a>, <a href="https://publications.waset.org/abstracts/search?q=Hossein%20Maghsoudi"> Hossein Maghsoudi</a>, <a href="https://publications.waset.org/abstracts/search?q=Malahat%20Givar"> Malahat Givar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this study, the three-dimensional optimal path planning of a flying robot for Terrain Following / Terrain Avoidance (TF/TA) purposes using Direct Collocation has been investigated. To this purpose, firstly, the appropriate equations of motion representing the flying robot translational movement have been described. The three-dimensional optimal path planning of the flying vehicle in terrain following/terrain avoidance maneuver is formulated as an optimal control problem. The terrain profile, as the main allowable height constraint has been modeled using Fractal Generation Method. The resulting optimal control problem is discretized by applying Direct Collocation numerical technique, and then transformed into a Nonlinear Programming Problem (NLP). The efficacy of the proposed method is demonstrated by extensive simulations, and in particular, it is verified that this approach could produce a solution satisfying almost all performance and environmental constraints encountering a low-level flying maneuver <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=path%20planning" title="path planning">path planning</a>, <a href="https://publications.waset.org/abstracts/search?q=terrain%20following" title=" terrain following"> terrain following</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20control" title=" optimal control"> optimal control</a>, <a href="https://publications.waset.org/abstracts/search?q=nonlinear%20programming" title=" nonlinear programming"> nonlinear programming</a> </p> <a href="https://publications.waset.org/abstracts/98941/three-dimensional-optimal-path-planning-of-a-flying-robot-for-terrain-followingterrain-avoidance" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/98941.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">188</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">8522</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">8521</span> Multi Objective Near-Optimal Trajectory Planning of Mobile Robot </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Amar%20Khoukhi">Amar Khoukhi</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20Shahab"> Mohamed Shahab</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents the optimal control problem of mobile robot motion as a nonlinear programming problem (NLP) and solved using a direct method of numerical optimal control. The NLP is initialized with a B-Spline for which node locations are optimized using a genetic search. The system acceleration inputs and sampling periods are considered as optimization variables. Different scenarios with different objectives weights are implemented and investigated. Interesting results are found in terms of complying with the expected behavior of a mobile robot system and time-energy minimization. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=multi-objective%20control" title="multi-objective control">multi-objective control</a>, <a href="https://publications.waset.org/abstracts/search?q=non-holonomic%20systems" title=" non-holonomic systems"> non-holonomic systems</a>, <a href="https://publications.waset.org/abstracts/search?q=mobile%20robots" title=" mobile robots"> mobile robots</a>, <a href="https://publications.waset.org/abstracts/search?q=nonlinear%20programming" title=" nonlinear programming"> nonlinear programming</a>, <a href="https://publications.waset.org/abstracts/search?q=motion%20planning" title=" motion planning"> motion planning</a>, <a href="https://publications.waset.org/abstracts/search?q=B-spline" title=" B-spline"> B-spline</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithm" title=" genetic algorithm"> genetic algorithm</a> </p> <a href="https://publications.waset.org/abstracts/14286/multi-objective-near-optimal-trajectory-planning-of-mobile-robot" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/14286.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">369</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">8520</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">8519</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">8518</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">8517</span> X-Ray Dynamical Diffraction 'Third Order Nonlinear Renninger Effect'</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Minas%20Balyan">Minas Balyan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Nowadays X-ray nonlinear diffraction and nonlinear effects are investigated due to the presence of the third generation synchrotron sources and XFELs. X-ray third order nonlinear dynamical diffraction is considered as well. Using the nonlinear model of the usual visible light optics the third-order nonlinear Takagi’s equations for monochromatic waves and the third-order nonlinear time-dependent dynamical diffraction equations for X-ray pulses are obtained by the author in previous papers. The obtained equations show, that even if the Fourier-coefficients of the linear and the third order nonlinear susceptibilities are zero (forbidden reflection), the dynamical diffraction in the nonlinear case is related to the presence in the nonlinear equations the terms proportional to the zero order and the second order nonzero Fourier coefficients of the third order nonlinear susceptibility. Thus, in the third order nonlinear Bragg diffraction case a nonlinear analogue of the well-known Renninger effect takes place. In this work, the 'third order nonlinear Renninger effect' is considered theoretically. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bragg%20diffraction" title="Bragg diffraction">Bragg diffraction</a>, <a href="https://publications.waset.org/abstracts/search?q=nonlinear%20Takagi%E2%80%99s%20equations" title=" nonlinear Takagi’s equations"> nonlinear Takagi’s equations</a>, <a href="https://publications.waset.org/abstracts/search?q=nonlinear%20Renninger%20effect" title=" nonlinear Renninger effect"> nonlinear Renninger effect</a>, <a href="https://publications.waset.org/abstracts/search?q=third%20order%20nonlinearity" title=" third order nonlinearity"> third order nonlinearity</a> </p> <a href="https://publications.waset.org/abstracts/55035/x-ray-dynamical-diffraction-third-order-nonlinear-renninger-effect" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/55035.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">385</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">8516</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">8515</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">8514</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">8513</span> Numerical Iteration Method to Find New Formulas for Nonlinear Equations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kholod%20Mohammad%20Abualnaja">Kholod Mohammad Abualnaja</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A new algorithm is presented to find some new iterative methods for solving nonlinear equations F(x)=0 by using the variational iteration method. The efficiency of the considered method is illustrated by example. The results show that the proposed iteration technique, without linearization or small perturbation, is very effective and convenient. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=variational%20iteration%20method" title="variational iteration method">variational iteration method</a>, <a href="https://publications.waset.org/abstracts/search?q=nonlinear%20equations" title=" nonlinear equations"> nonlinear equations</a>, <a href="https://publications.waset.org/abstracts/search?q=Lagrange%20multiplier" title=" Lagrange multiplier"> Lagrange multiplier</a>, <a href="https://publications.waset.org/abstracts/search?q=algorithms" title=" algorithms "> algorithms </a> </p> <a href="https://publications.waset.org/abstracts/12184/numerical-iteration-method-to-find-new-formulas-for-nonlinear-equations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/12184.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">545</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">8512</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">8511</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">8510</span> Design of a Fuzzy Luenberger Observer for Fault Nonlinear System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mounir%20Bekaik">Mounir Bekaik</a>, <a href="https://publications.waset.org/abstracts/search?q=Messaoud%20Ramdani"> Messaoud Ramdani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We present in this work a new technique of stabilization for fault nonlinear systems. The approach we adopt focus on a fuzzy Luenverger observer. The T-S approximation of the nonlinear observer is based on fuzzy C-Means clustering algorithm to find local linear subsystems. The MOESP identification approach was applied to design an empirical model describing the subsystems state variables. The gain of the observer is given by the minimization of the estimation error through Lyapunov-krasovskii functional and LMI approach. We consider a three tank hydraulic system for an illustrative example. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=nonlinear%20system" title="nonlinear system">nonlinear system</a>, <a href="https://publications.waset.org/abstracts/search?q=fuzzy" title=" fuzzy"> fuzzy</a>, <a href="https://publications.waset.org/abstracts/search?q=faults" title=" faults"> faults</a>, <a href="https://publications.waset.org/abstracts/search?q=TS" title=" TS"> TS</a>, <a href="https://publications.waset.org/abstracts/search?q=Lyapunov-Krasovskii" title=" Lyapunov-Krasovskii"> Lyapunov-Krasovskii</a>, <a href="https://publications.waset.org/abstracts/search?q=observer" title=" observer"> observer</a> </p> <a href="https://publications.waset.org/abstracts/47230/design-of-a-fuzzy-luenberger-observer-for-fault-nonlinear-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/47230.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">332</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">8509</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">8508</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">8507</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">8506</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">8505</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">8504</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=nonlinear%20programming%20technique&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=nonlinear%20programming%20technique&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=nonlinear%20programming%20technique&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=nonlinear%20programming%20technique&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=nonlinear%20programming%20technique&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=nonlinear%20programming%20technique&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=nonlinear%20programming%20technique&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=nonlinear%20programming%20technique&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=nonlinear%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=nonlinear%20programming%20technique&page=284">284</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=nonlinear%20programming%20technique&page=285">285</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=nonlinear%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>