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: preference optimization programming</title> <meta name="description" content="Search results for: preference optimization programming"> <meta name="keywords" content="preference optimization programming"> <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="preference optimization programming" 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/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="preference optimization programming"> <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> 2471</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: preference optimization programming</h1> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2471</span> Aircraft Selection Using Preference Optimization Programming (POP)</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=C.%20Ardil">C. Ardil</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>A multiple-criteria decision support system is proposed for the best aircraft selection decision. Various strategic, economic, environmental, and risk-related factors can directly or indirectly influence this choice, and they should be taken into account in the decision-making process. The paper suggests a multiple-criteria analysis to aid in the airline management's decision-making process when choosing an appropriate aircraft. In terms of the suggested approach, an integrated entropic preference optimization programming (POP) for fleet modeling risk analysis is applied. The findings of the study of multiple criteria analysis indicate that the A321(neo) aircraft type is the best alternative in this particular optimization instance. The proposed methodology can be applied to other complex engineering problems involving multiple criteria analysis.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Aircraft%20selection" title="Aircraft selection">Aircraft selection</a>, <a href="https://publications.waset.org/search?q=decision%20making" title=" decision making"> decision making</a>, <a href="https://publications.waset.org/search?q=multiple%20criteria%20decision%20making" title=" multiple criteria decision making"> multiple criteria decision making</a>, <a href="https://publications.waset.org/search?q=preference%20optimization%20programming" title=" preference optimization programming"> preference optimization programming</a>, <a href="https://publications.waset.org/search?q=POP" title=" POP"> POP</a>, <a href="https://publications.waset.org/search?q=entropic%20weight%20method" title=" entropic weight method"> entropic weight method</a>, <a href="https://publications.waset.org/search?q=TOPSIS" title=" TOPSIS"> TOPSIS</a>, <a href="https://publications.waset.org/search?q=WSM" title=" WSM"> WSM</a>, <a href="https://publications.waset.org/search?q=WPM" title=" WPM"> WPM</a> </p> <a href="https://publications.waset.org/10012772/aircraft-selection-using-preference-optimization-programming-pop" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10012772/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10012772/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10012772/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10012772/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10012772/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10012772/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10012772/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10012772/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10012772/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10012772/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10012772.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">625</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2470</span> Mathematical Programming Models for Portfolio Optimization Problem: A Review</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=M.%20Mokhtar">M. Mokhtar</a>, <a href="https://publications.waset.org/search?q=A.%20Shuib"> A. Shuib</a>, <a href="https://publications.waset.org/search?q=D.%20Mohamad"> D. Mohamad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Portfolio optimization problem has received a lot of attention from both researchers and practitioners over the last six decades. This paper provides an overview of the current state of research in portfolio optimization with the support of mathematical programming techniques. On top of that, this paper also surveys the solution algorithms for solving portfolio optimization models classifying them according to their nature in heuristic and exact methods. To serve these purposes, 40 related articles appearing in the international journal from 2003 to 2013 have been gathered and analyzed. Based on the literature review, it has been observed that stochastic programming and goal programming constitute the highest number of mathematical programming techniques employed to tackle the portfolio optimization problem. It is hoped that the paper can meet the needs of researchers and practitioners for easy references of portfolio optimization.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Portfolio%20optimization" title="Portfolio optimization">Portfolio optimization</a>, <a href="https://publications.waset.org/search?q=Mathematical%20programming" title=" Mathematical programming"> Mathematical programming</a>, <a href="https://publications.waset.org/search?q=Multi-objective%20programming" title=" Multi-objective programming"> Multi-objective programming</a>, <a href="https://publications.waset.org/search?q=Solution%20approaches." title=" Solution approaches."> Solution approaches.</a> </p> <a href="https://publications.waset.org/9997391/mathematical-programming-models-for-portfolio-optimization-problem-a-review" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9997391/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9997391/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9997391/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9997391/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9997391/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9997391/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9997391/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9997391/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9997391/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9997391/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9997391.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">6573</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2469</span> Fighter Aircraft Selection Using Fuzzy Preference Optimization Programming (POP)</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=C.%20Ardil">C. Ardil</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The Turkish Air Force needs to acquire a sixth- generation fighter aircraft in order to maintain its air superiority and dominance against its rivals under the risks posed by global geopolitical opportunities and threats. Accordingly, five evaluation criteria were determined to evaluate the sixth-generation fighter aircraft alternatives and to select the best one. Systematically, a new fuzzy preference optimization programming (POP) method is proposed to select the best sixth generation fighter aircraft in an uncertain environment. The POP technique considers both quantitative and qualitative evaluation criteria. To demonstrate the applicability and effectiveness of the proposed approach, it is applied to a multiple criteria decision-making problem to evaluate and select sixth-generation fighter aircraft. The results of the fuzzy POP method are compared with the results of the fuzzy TOPSIS approach to validate it. According to the comparative analysis, fuzzy POP and fuzzy TOPSIS methods get the same results. This demonstrates the applicability of the fuzzy POP technique to address the sixth-generation fighter selection problem.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Fighter%20aircraft%20selection" title="Fighter aircraft selection">Fighter aircraft selection</a>, <a href="https://publications.waset.org/search?q=sixth-generation%20fighter%20aircraft" title=" sixth-generation fighter aircraft"> sixth-generation fighter aircraft</a>, <a href="https://publications.waset.org/search?q=fuzzy%20decision%20process" title=" fuzzy decision process"> fuzzy decision process</a>, <a href="https://publications.waset.org/search?q=multiple%20criteria%20decision%20making" title=" multiple criteria decision making"> multiple criteria decision making</a>, <a href="https://publications.waset.org/search?q=preference%20optimization%20programming" title=" preference optimization programming"> preference optimization programming</a>, <a href="https://publications.waset.org/search?q=POP" title=" POP"> POP</a>, <a href="https://publications.waset.org/search?q=TOPSIS" title=" TOPSIS"> TOPSIS</a>, <a href="https://publications.waset.org/search?q=Kizilelma" title=" Kizilelma"> Kizilelma</a>, <a href="https://publications.waset.org/search?q=MIUS" title=" MIUS"> MIUS</a>, <a href="https://publications.waset.org/search?q=fuzzy%20set%20theory" title=" fuzzy set theory"> fuzzy set theory</a> </p> <a href="https://publications.waset.org/10012749/fighter-aircraft-selection-using-fuzzy-preference-optimization-programming-pop" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10012749/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10012749/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10012749/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10012749/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10012749/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10012749/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10012749/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10012749/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10012749/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10012749/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10012749.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">447</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2468</span> Selecting Stealth Aircraft Using Determinate Fuzzy Preference Programming in Multiple Criteria Decision Making</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=C.%20Ardil">C. Ardil</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This paper investigates the application of the determinate fuzzy preference programming method for a more nuanced and comprehensive evaluation of stealth aircraft. Traditional methods often struggle to incorporate subjective factors and uncertainties inherent in complex systems like stealth aircraft. Determinate fuzzy preference programming addresses this limitation by leveraging the strengths of determinate fuzzy sets. The proposed novel multiple criteria decision-making algorithm integrates these concepts to consider aspects and criteria influencing aircraft performance. This approach aims to provide a more holistic assessment by enabling decision-makers to observe positive and negative outranking flows simultaneously. By demonstrating the validity and effectiveness of this approach through a practical example of selecting a stealth aircraft, this paper aims to establish the determinate fuzzy preference programming method as a valuable tool for informed decision-making in this critical domain.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Determinate%20fuzzy%20set" title="Determinate fuzzy set">Determinate fuzzy set</a>, <a href="https://publications.waset.org/search?q=stealth%20aircraft%20selection" title=" stealth aircraft selection"> stealth aircraft selection</a>, <a href="https://publications.waset.org/search?q=distance%20function" title=" distance function"> distance function</a>, <a href="https://publications.waset.org/search?q=decision%20making" title=" decision making"> decision making</a>, <a href="https://publications.waset.org/search?q=uncertainty" title=" uncertainty"> uncertainty</a>, <a href="https://publications.waset.org/search?q=preference%20programming.%20MCDM" title=" preference programming. MCDM"> preference programming. MCDM</a> </p> <a href="https://publications.waset.org/10013642/selecting-stealth-aircraft-using-determinate-fuzzy-preference-programming-in-multiple-criteria-decision-making" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10013642/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10013642/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10013642/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10013642/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10013642/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10013642/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10013642/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10013642/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10013642/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10013642/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10013642.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">145</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2467</span> Production Plan and Technological Variants Optimization by Goal Programming Methods</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Tunjo%20Peri%C4%87">Tunjo Peri膰</a>, <a href="https://publications.waset.org/search?q=Franjo%20Brati%C4%87"> Franjo Brati膰</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, the goal programming methodology for solving multiple objective problem of the technological variants and production plan optimization has been applied. The optimization criteria are determined and the multiple objective linear programming model for solving a problem of the technological variants and production plan optimization is formed and solved. Then the obtained results are analysed. The obtained results point out to the possibility of efficient application of the goal programming methodology in solving the problem of the technological variants and production plan optimization. The paper points out on the advantages of the application of the goal programming methodology compare to the Surrogat Worth Trade-off method in solving this problem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Goal%20programming" title="Goal programming">Goal programming</a>, <a href="https://publications.waset.org/search?q=multi%20objective%20programming" title=" multi objective programming"> multi objective programming</a>, <a href="https://publications.waset.org/search?q=production%20plan" title=" production plan"> production plan</a>, <a href="https://publications.waset.org/search?q=SWT%20method" title=" SWT method"> SWT method</a>, <a href="https://publications.waset.org/search?q=technological%20variants." title=" technological variants."> technological variants.</a> </p> <a href="https://publications.waset.org/10001765/production-plan-and-technological-variants-optimization-by-goal-programming-methods" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10001765/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10001765/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10001765/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10001765/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10001765/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10001765/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10001765/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10001765/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10001765/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10001765/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10001765.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">1918</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2466</span> Facility Location Selection using Preference Programming</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=C.%20Ardil">C. Ardil</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This paper presents preference programming technique based multiple criteria decision making analysis for selecting a facility location for a new organization or expansion of an existing facility which is of vital importance for a decision support system and strategic planning process. The implementation of decision support systems is considered crucial to sustain competitive advantage and profitability persistence in turbulent environment. As an effective strategic management and decision making is necessary, multiple criteria decision making analysis supports the decision makers to formulate and implement the right strategy. The investment cost associated with acquiring the property and facility construction makes the facility location selection problem a long-term strategic investment decision, which rationalize the best location selection which results in higher economic benefits through increased productivity and optimal distribution network. Selecting the proper facility location from a given set of alternatives is a difficult task, as many potential qualitative and quantitative multiple conflicting criteria are to be considered. This paper solves a facility location selection problem using preference programming, which is an effective multiple criteria decision making analysis tool applied to deal with complex decision problems in the operational research environment. The ranking results of preference programming are compared with WSM, TOPSIS and VIKOR methods.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Facility%20Location%20Selection" title="Facility Location Selection">Facility Location Selection</a>, <a href="https://publications.waset.org/search?q=Multiple%20Criteria%20Decision%20Making" title=" Multiple Criteria Decision Making"> Multiple Criteria Decision Making</a>, <a href="https://publications.waset.org/search?q=Multiple%20Criteria%20Decision%20Making%20Analysis" title=" Multiple Criteria Decision Making Analysis"> Multiple Criteria Decision Making Analysis</a>, <a href="https://publications.waset.org/search?q=Preference%20Programming" title=" Preference Programming"> Preference Programming</a>, <a href="https://publications.waset.org/search?q=Location%20Selection" title=" Location Selection"> Location Selection</a>, <a href="https://publications.waset.org/search?q=WSM" title=" WSM"> WSM</a>, <a href="https://publications.waset.org/search?q=TOPSIS" title=" TOPSIS"> TOPSIS</a>, <a href="https://publications.waset.org/search?q=VIKOR" title=" VIKOR"> VIKOR</a> </p> <a href="https://publications.waset.org/10012212/facility-location-selection-using-preference-programming" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10012212/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10012212/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10012212/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10012212/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10012212/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10012212/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10012212/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10012212/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10012212/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10012212/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10012212.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">540</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2465</span> Performance Analysis of MATLAB Solvers in the Case of a Quadratic Programming Generation Scheduling Optimization Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=D%C3%A1vid%20Csercsik">D谩vid Csercsik</a>, <a href="https://publications.waset.org/search?q=P%C3%A9ter%20K%C3%A1d%C3%A1r"> P茅ter K谩d谩r</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the case of the proposed method, the problem is parallelized by considering multiple possible mode of operation profiles, which determine the range in which the generators operate in each period. For each of these profiles, the optimization is carried out independently, and the best resulting dispatch is chosen. For each such profile, the resulting problem is a quadratic programming (QP) problem with a potentially negative definite Q quadratic term, and constraints depending on the actual operation profile. In this paper we analyze the performance of available MATLAB optimization methods and solvers for the corresponding QP. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Economic%20dispatch" title="Economic dispatch">Economic dispatch</a>, <a href="https://publications.waset.org/search?q=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/search?q=quadratic%0D%0Aprogramming" title=" quadratic programming"> quadratic programming</a>, <a href="https://publications.waset.org/search?q=MATLAB." title=" MATLAB."> MATLAB.</a> </p> <a href="https://publications.waset.org/10009920/performance-analysis-of-matlab-solvers-in-the-case-of-a-quadratic-programming-generation-scheduling-optimization-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10009920/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10009920/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10009920/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10009920/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10009920/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10009920/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10009920/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10009920/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10009920/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10009920/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10009920.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">948</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2464</span> Bioprocess Optimization Based On Relevance Vector Regression Models and Evolutionary Programming Technique</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=R.%20Simutis">R. Simutis</a>, <a href="https://publications.waset.org/search?q=V.%20Galvanauskas"> V. Galvanauskas</a>, <a href="https://publications.waset.org/search?q=D.%20Levisauskas"> D. Levisauskas</a>, <a href="https://publications.waset.org/search?q=J.%20Repsyte"> J. Repsyte</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This paper proposes a bioprocess optimization procedure based on Relevance Vector Regression models and evolutionary programming technique. Relevance Vector Regression scheme allows developing a compact and stable data-based process model avoiding time-consuming modeling expenses. The model building and process optimization procedure could be done in a half-automated way and repeated after every new cultivation run. The proposed technique was tested in a simulated mammalian cell cultivation process. The obtained results are promising and could be attractive for optimization of industrial bioprocesses.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Bioprocess%20optimization" title="Bioprocess optimization">Bioprocess optimization</a>, <a href="https://publications.waset.org/search?q=Evolutionary%0D%0Aprogramming" title=" Evolutionary programming"> Evolutionary programming</a>, <a href="https://publications.waset.org/search?q=Relevance%20Vector%20Regression." title=" Relevance Vector Regression."> Relevance Vector Regression.</a> </p> <a href="https://publications.waset.org/9998131/bioprocess-optimization-based-on-relevance-vector-regression-models-and-evolutionary-programming-technique" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9998131/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9998131/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9998131/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9998131/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9998131/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9998131/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9998131/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9998131/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9998131/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9998131/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9998131.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">2195</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2463</span> A Novel Optimal Setting for Directional over Current Relay Coordination using Particle Swarm Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=D.%20Vijayakumar">D. Vijayakumar</a>, <a href="https://publications.waset.org/search?q=R.%20K.%20Nema"> R. K. Nema</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Over Current Relays (OCRs) and Directional Over Current Relays (DOCRs) are widely used for the radial protection and ring sub transmission protection systems and for distribution systems. All previous work formulates the DOCR coordination problem either as a Non-Linear Programming (NLP) for TDS and Ip or as a Linear Programming (LP) for TDS using recently a social behavior (Particle Swarm Optimization techniques) introduced to the work. In this paper, a Modified Particle Swarm Optimization (MPSO) technique is discussed for the optimal settings of DOCRs in power systems as a Non-Linear Programming problem for finding Ip values of the relays and for finding the TDS setting as a linear programming problem. The calculation of the Time Dial Setting (TDS) and the pickup current (Ip) setting of the relays is the core of the coordination study. PSO technique is considered as realistic and powerful solution schemes to obtain the global or quasi global optimum in optimization problem.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Directional%20over%20current%20relays" title="Directional over current relays">Directional over current relays</a>, <a href="https://publications.waset.org/search?q=Optimization%0D%0Atechniques" title=" Optimization techniques"> Optimization techniques</a>, <a href="https://publications.waset.org/search?q=Particle%20swarm%20optimization" title=" Particle swarm optimization"> Particle swarm optimization</a>, <a href="https://publications.waset.org/search?q=Power%20system%20protection." title=" Power system protection."> Power system protection.</a> </p> <a href="https://publications.waset.org/12951/a-novel-optimal-setting-for-directional-over-current-relay-coordination-using-particle-swarm-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/12951/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/12951/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/12951/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/12951/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/12951/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/12951/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/12951/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/12951/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/12951/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/12951/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/12951.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">2755</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2462</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/search?q=Z.%20Babic">Z. Babic</a>, <a href="https://publications.waset.org/search?q=I.%20Veza"> I. Veza</a>, <a href="https://publications.waset.org/search?q=A.%20Balic"> A. Balic</a>, <a href="https://publications.waset.org/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/search?q=De%20Novo%20Programming" title="De Novo Programming">De Novo Programming</a>, <a href="https://publications.waset.org/search?q=production%20plan" title=" production plan"> production plan</a>, <a href="https://publications.waset.org/search?q=stone%20souvenirs" title=" stone souvenirs"> stone souvenirs</a>, <a href="https://publications.waset.org/search?q=variable%20prices." title=" variable prices."> variable prices.</a> </p> <a href="https://publications.waset.org/10008915/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/10008915/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10008915/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10008915/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10008915/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10008915/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10008915/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10008915/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10008915/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10008915/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10008915/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10008915.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">1246</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2461</span> Combining Ant Colony Optimization and Dynamic Programming for Solving a Dynamic Facility Layout Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=A.%20Udomsakdigool">A. Udomsakdigool</a>, <a href="https://publications.waset.org/search?q=S.%20Bangsaranthip"> S. Bangsaranthip</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents an algorithm which combining ant colony optimization in the dynamic programming for solving a dynamic facility layout problem. The problem is separated into 2 phases, static and dynamic phase. In static phase, ant colony optimization is used to find the best ranked of layouts for each period. Then the dynamic programming (DP) procedure is performed in the dynamic phase to evaluate the layout set during multi-period planning horizon. The proposed algorithm is tested over many problems with size ranging from 9 to 49 departments, 2 and 4 periods. The experimental results show that the proposed method is an alternative way for the plant layout designer to determine the layouts during multi-period planning horizon. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Ant%20colony%20optimization" title="Ant colony optimization">Ant colony optimization</a>, <a href="https://publications.waset.org/search?q=Dynamicprogramming" title=" Dynamicprogramming"> Dynamicprogramming</a>, <a href="https://publications.waset.org/search?q=Dynamic%20facility%20layout%20planning" title=" Dynamic facility layout planning"> Dynamic facility layout planning</a>, <a href="https://publications.waset.org/search?q=Metaheuristic" title="Metaheuristic">Metaheuristic</a> </p> <a href="https://publications.waset.org/7157/combining-ant-colony-optimization-and-dynamic-programming-for-solving-a-dynamic-facility-layout-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/7157/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/7157/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/7157/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/7157/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/7157/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/7157/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/7157/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/7157/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/7157/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/7157/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/7157.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">1945</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2460</span> Applications of Conic Optimization and Quadratic Programming in the Investigation of Index Arbitrage in the Thai Derivatives and Equity Markets</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Satjaporn%20Tungsong">Satjaporn Tungsong</a>, <a href="https://publications.waset.org/search?q=Gun%20Srijuntongsiri"> Gun Srijuntongsiri</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This research seeks to investigate the frequency and profitability of index arbitrage opportunities involving the SET50 futures, SET50 component stocks, and the ThaiDEX SET50 ETF (ticker symbol: TDEX). In particular, the frequency and profit of arbitrage are measured in the following three arbitrage tests: (1) SET50 futures vs. ThaiDEX SET50 ETF, (2) SET50 futures vs. SET50 component stocks, and (3) ThaiDEX SET50 ETF vs. SET50 component stocks are investigated. For tests (2) and (3), the problems involve conic optimization and quadratic programming as subproblems. This research is first to apply conic optimization and quadratic programming techniques in the context of index arbitrage and is first to investigate such index arbitrage in the Thai equity and derivatives markets. Thus, the contribution of this study is twofold. First, its results would help understand the contribution of the derivatives securities to the efficiency of the Thai markets. Second, the methodology employed in this study can be applied to other geographical markets, with minor adjustments. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Conic%20optimization" title="Conic optimization">Conic optimization</a>, <a href="https://publications.waset.org/search?q=Equity%20index%20arbitrage" title=" Equity index arbitrage"> Equity index arbitrage</a>, <a href="https://publications.waset.org/search?q=Executionlags" title=" Executionlags"> Executionlags</a>, <a href="https://publications.waset.org/search?q=Quadratic%20programming" title=" Quadratic programming"> Quadratic programming</a>, <a href="https://publications.waset.org/search?q=SET50%20index%20futures" title=" SET50 index futures"> SET50 index futures</a>, <a href="https://publications.waset.org/search?q=ThaiDEX%20SET50ETF" title=" ThaiDEX SET50ETF"> ThaiDEX SET50ETF</a>, <a href="https://publications.waset.org/search?q=Transaction%20costs" title=" Transaction costs"> Transaction costs</a> </p> <a href="https://publications.waset.org/10717/applications-of-conic-optimization-and-quadratic-programming-in-the-investigation-of-index-arbitrage-in-the-thai-derivatives-and-equity-markets" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10717/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10717/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10717/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10717/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10717/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10717/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10717/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10717/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10717/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10717/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10717.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">1574</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2459</span> Multi-Objective Optimization of Combined System Reliability and Redundancy Allocation Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Vijaya%20K.%20Srivastava">Vijaya K. Srivastava</a>, <a href="https://publications.waset.org/search?q=Davide%20Spinello"> Davide Spinello</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This paper presents established 3<strong><sup>n</sup></strong> enumeration procedure for mixed integer optimization problems for solving multi-objective reliability and redundancy allocation problem subject to design constraints. The formulated problem is to find the optimum level of unit reliability and the number of units for each subsystem. A number of illustrative examples are provided and compared to indicate the application of the superiority of the proposed method.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Integer%20programming" title="Integer programming">Integer programming</a>, <a href="https://publications.waset.org/search?q=mixed%20integer%20programming" title=" mixed integer programming"> mixed integer programming</a>, <a href="https://publications.waset.org/search?q=multi-objective%20optimization" title=" multi-objective optimization"> multi-objective optimization</a>, <a href="https://publications.waset.org/search?q=reliability%20redundancy%20allocation." title=" reliability redundancy allocation. "> reliability redundancy allocation. </a> </p> <a href="https://publications.waset.org/10010655/multi-objective-optimization-of-combined-system-reliability-and-redundancy-allocation-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10010655/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10010655/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10010655/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10010655/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10010655/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10010655/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10010655/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10010655/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10010655/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10010655/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10010655.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">668</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2458</span> Pricing Strategy Selection Using Fuzzy Linear Programming</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Elif%20Alaybeyo%C4%9Flu">Elif Alaybeyo臒lu</a>, <a href="https://publications.waset.org/search?q=Y.%20Esra%20Albayrak"> Y. Esra Albayrak</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p class="Abstract" style="text-indent:10.2pt">Marketing establishes a communication network between producers and consumers. Nowadays, marketing approach is customer-focused and products are directly oriented to meet customer needs. Marketing, which is a long process, needs organization and management. Therefore strategic marketing planning becomes more and more important in today’s competitive conditions. Main focus of this paper is to evaluate pricing strategies and select the best pricing strategy solution while considering internal and external factors influencing the company’s pricing decisions associated with new product development. To reflect the decision maker’s subjective preference information and to determine the weight vector of factors (attributes), the fuzzy linear programming technique for multidimensional analysis of preference (LINMAP) under intuitionistic fuzzy (IF) environments is used.<o:p></o:p></p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=IF%20Sets" title="IF Sets">IF Sets</a>, <a href="https://publications.waset.org/search?q=LINMAP" title=" LINMAP"> LINMAP</a>, <a href="https://publications.waset.org/search?q=MAGDM" title=" MAGDM"> MAGDM</a>, <a href="https://publications.waset.org/search?q=Marketing." title=" Marketing."> Marketing.</a> </p> <a href="https://publications.waset.org/17001/pricing-strategy-selection-using-fuzzy-linear-programming" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/17001/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/17001/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/17001/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/17001/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/17001/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/17001/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/17001/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/17001/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/17001/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/17001/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/17001.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">2263</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2457</span> Multi-objective Optimization of Vehicle Passive Suspension with a Two-Terminal Mass Using Chebyshev Goal Programming</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Chuan%20Li">Chuan Li</a>, <a href="https://publications.waset.org/search?q=Ming%20Liang"> Ming Liang</a>, <a href="https://publications.waset.org/search?q=Qibing%20Yu"> Qibing Yu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> To improve the dynamics response of the vehicle passive suspension, a two-terminal mass is suggested to connect in parallel with the suspension strut. Three performance criteria, tire grip, ride comfort and suspension deflection, are taken into consideration to optimize the suspension parameters. However, the three criteria are conflicting and non-commensurable. For this reason, the Chebyshev goal programming method is applied to find the best tradeoff among the three objectives. A simulation case is presented to describe the multi-objective optimization procedure. For comparison, the Chebyshev method is also employed to optimize the design of a conventional passive suspension. The effectiveness of the proposed design method has been clearly demonstrated by the result. It is also shown that the suspension with a two-terminal mass in parallel has better performance in terms of the three objectives. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Vehicle" title="Vehicle">Vehicle</a>, <a href="https://publications.waset.org/search?q=passive%20suspension" title=" passive suspension"> passive suspension</a>, <a href="https://publications.waset.org/search?q=two-terminal%20mass" title=" two-terminal mass"> two-terminal mass</a>, <a href="https://publications.waset.org/search?q=optimization" title="optimization">optimization</a>, <a href="https://publications.waset.org/search?q=Chebyshev%20goal%20programming" title=" Chebyshev goal programming"> Chebyshev goal programming</a> </p> <a href="https://publications.waset.org/8202/multi-objective-optimization-of-vehicle-passive-suspension-with-a-two-terminal-mass-using-chebyshev-goal-programming" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/8202/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/8202/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/8202/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/8202/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/8202/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/8202/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/8202/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/8202/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/8202/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/8202/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/8202.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">1759</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2456</span> A Deterministic Dynamic Programming Approach for Optimization Problem with Quadratic Objective Function and Linear Constraints</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=S.%20Kavitha">S. Kavitha</a>, <a href="https://publications.waset.org/search?q=Nirmala%20P.%20Ratchagar"> Nirmala P. Ratchagar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This paper presents the novel deterministic dynamic programming approach for solving optimization problem with quadratic objective function with linear equality and inequality constraints. The proposed method employs backward recursion in which computations proceeds from last stage to first stage in a multi-stage decision problem. A generalized recursive equation which gives the exact solution of an optimization problem is derived in this paper. The method is purely analytical and avoids the usage of initial solution. The feasibility of the proposed method is demonstrated with a practical example. The numerical results show that the proposed method provides global optimum solution with negligible computation time.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Backward%20recursion" title="Backward recursion">Backward recursion</a>, <a href="https://publications.waset.org/search?q=Dynamic%20programming" title=" Dynamic programming"> Dynamic programming</a>, <a href="https://publications.waset.org/search?q=Multi-stage%20decision%20problem" title=" Multi-stage decision problem"> Multi-stage decision problem</a>, <a href="https://publications.waset.org/search?q=Quadratic%20objective%20function." title=" Quadratic objective function."> Quadratic objective function.</a> </p> <a href="https://publications.waset.org/17124/a-deterministic-dynamic-programming-approach-for-optimization-problem-with-quadratic-objective-function-and-linear-constraints" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/17124/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/17124/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/17124/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/17124/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/17124/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/17124/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/17124/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/17124/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/17124/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/17124/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/17124.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">3587</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2455</span> Dynamic Slope Scaling Procedure for Stochastic Integer Programming Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Takayuki%20Shiina">Takayuki Shiina</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Mathematical programming has been applied to various problems. For many actual problems, the assumption that the parameters involved are deterministic known data is often unjustified. In such cases, these data contain uncertainty and are thus represented as random variables, since they represent information about the future. Decision-making under uncertainty involves potential risk. Stochastic programming is a commonly used method for optimization under uncertainty. A stochastic programming problem with recourse is referred to as a two-stage stochastic problem. In this study, we consider a stochastic programming problem with simple integer recourse in which the value of the recourse variable is restricted to a multiple of a nonnegative integer. The algorithm of a dynamic slope scaling procedure for solving this problem is developed by using a property of the expected recourse function. Numerical experiments demonstrate that the proposed algorithm is quite efficient. The stochastic programming model defined in this paper is quite useful for a variety of design and operational problems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=stochastic%20programming%20problem%20with%20recourse" title="stochastic programming problem with recourse">stochastic programming problem with recourse</a>, <a href="https://publications.waset.org/search?q=simple%0Ainteger%20recourse" title=" simple integer recourse"> simple integer recourse</a>, <a href="https://publications.waset.org/search?q=dynamic%20slope%20scaling%20procedure" title=" dynamic slope scaling procedure"> dynamic slope scaling procedure</a> </p> <a href="https://publications.waset.org/7142/dynamic-slope-scaling-procedure-for-stochastic-integer-programming-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/7142/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/7142/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/7142/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/7142/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/7142/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/7142/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/7142/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/7142/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/7142/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/7142/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/7142.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">1616</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2454</span> Adaptation of Iterative Methods to Solve Fuzzy Mathematical Programming Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Ricardo%20C.%20Silva">Ricardo C. Silva</a>, <a href="https://publications.waset.org/search?q=Luiza%20A.%20P.%20Cantao"> Luiza A. P. Cantao</a>, <a href="https://publications.waset.org/search?q=Akebo%20Yamakami"> Akebo Yamakami</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Based on the fuzzy set theory this work develops two adaptations of iterative methods that solve mathematical programming problems with uncertainties in the objective function and in the set of constraints. The first one uses the approach proposed by Zimmermann to fuzzy linear programming problems as a basis and the second one obtains cut levels and later maximizes the membership function of fuzzy decision making using the bound search method. We outline similarities between the two iterative methods studied. Selected examples from the literature are presented to validate the efficiency of the methods addressed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Fuzzy%20Theory" title="Fuzzy Theory">Fuzzy Theory</a>, <a href="https://publications.waset.org/search?q=Nonlinear%20Optimization" title=" Nonlinear Optimization"> Nonlinear Optimization</a>, <a href="https://publications.waset.org/search?q=Fuzzy%20Mathematics%20Programming." title=" Fuzzy Mathematics Programming."> Fuzzy Mathematics Programming.</a> </p> <a href="https://publications.waset.org/6547/adaptation-of-iterative-methods-to-solve-fuzzy-mathematical-programming-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/6547/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/6547/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/6547/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/6547/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/6547/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/6547/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/6547/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/6547/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/6547/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/6547/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/6547.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">1623</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2453</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/search?q=M.%20Boudjerda">M. Boudjerda</a>, <a href="https://publications.waset.org/search?q=B.%20Touaibia"> B. Touaibia</a>, <a href="https://publications.waset.org/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/search?q=ater%20management" title="ater management">ater management</a>, <a href="https://publications.waset.org/search?q=agricultural%20demand" title=" agricultural demand"> agricultural demand</a>, <a href="https://publications.waset.org/search?q=dam%20and%20reservoir%20operation" title=" dam and reservoir operation"> dam and reservoir operation</a>, <a href="https://publications.waset.org/search?q=Foum%20el-Gherza%20dam" title=" Foum el-Gherza dam"> Foum el-Gherza dam</a>, <a href="https://publications.waset.org/search?q=dynamic%20programming" title=" dynamic programming"> dynamic programming</a>, <a href="https://publications.waset.org/search?q=artificial%20neural%20network." title=" artificial neural network."> artificial neural network.</a> </p> <a href="https://publications.waset.org/10011223/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/10011223/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10011223/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10011223/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10011223/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10011223/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10011223/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10011223/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10011223/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10011223/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10011223/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10011223.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">730</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2452</span> Simulation and 40 Years of Object-Oriented Programming</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Eugene%20Kindler">Eugene Kindler</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>2007 is a jubilee year: in 1967, programming language SIMULA 67 was presented, which contained all aspects of what was later called object-oriented programming. The present paper contains a description of the development unto the objectoriented programming, the role of simulation in this development and other tools that appeared in SIMULA 67 and that are nowadays called super-object-oriented programming.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Simulation" title="Simulation">Simulation</a>, <a href="https://publications.waset.org/search?q=super-object-oriented%20programming" title=" super-object-oriented programming"> super-object-oriented programming</a>, <a href="https://publications.waset.org/search?q=object-oriented%20programming" title=" object-oriented programming"> object-oriented programming</a>, <a href="https://publications.waset.org/search?q=SIMULA." title=" SIMULA."> SIMULA.</a> </p> <a href="https://publications.waset.org/975/simulation-and-40-years-of-object-oriented-programming" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/975/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/975/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/975/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/975/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/975/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/975/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/975/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/975/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/975/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/975/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/975.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">1315</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2451</span> Preliminary Study on Fixture Layout Optimization Using Element Strain Energy</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Zeshan%20Ahmad">Zeshan Ahmad</a>, <a href="https://publications.waset.org/search?q=Matteo%20Zoppi"> Matteo Zoppi</a>, <a href="https://publications.waset.org/search?q=Rezia%20Molfino"> Rezia Molfino</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The objective of positioning the fixture elements in the fixture is to make the workpiece stiff, so that geometric errors in the manufacturing process can be reduced. Most of the work for optimal fixture layout used the minimization of the sum of the nodal deflection normal to the surface as objective function. All deflections in other direction have been neglected. We propose a new method for fixture layout optimization in this paper, which uses the element strain energy. The deformations in all the directions have been considered in this way. The objective function in this method is to minimize the sum of square of element strain energy. Strain energy and stiffness are inversely proportional to each other. The optimization problem is solved by the sequential quadratic programming method. Three different kinds of case studies are presented, and results are compared with the method using nodal deflections as objective function to verify the propose method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Fixture%20layout" title="Fixture layout">Fixture layout</a>, <a href="https://publications.waset.org/search?q=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/search?q=strain%20energy" title=" strain energy"> strain energy</a>, <a href="https://publications.waset.org/search?q=quadratic%0Aprogramming." title=" quadratic programming."> quadratic programming.</a> </p> <a href="https://publications.waset.org/2846/preliminary-study-on-fixture-layout-optimization-using-element-strain-energy" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/2846/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/2846/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/2846/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/2846/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/2846/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/2846/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/2846/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/2846/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/2846/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/2846/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/2846.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">1552</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2450</span> A Robust Optimization Model for the Single-Depot Capacitated Location-Routing Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Abdolsalam%20Ghaderi">Abdolsalam Ghaderi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, the single-depot capacitated location-routing problem under uncertainty is presented. The problem aims to find the optimal location of a single depot and the routing of vehicles to serve the customers when the parameters may change under different circumstances. This problem has many applications, especially in the area of supply chain management and distribution systems. To get closer to real-world situations, travel time of vehicles, the fixed cost of vehicles usage and customers’ demand are considered as a source of uncertainty. A combined approach including robust optimization and stochastic programming was presented to deal with the uncertainty in the problem at hand. For this purpose, a mixed integer programming model is developed and a heuristic algorithm based on Variable Neighborhood Search(VNS) is presented to solve the model. Finally, the computational results are presented and future research directions are discussed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Location-routing%20problem" title="Location-routing problem">Location-routing problem</a>, <a href="https://publications.waset.org/search?q=robust%20optimization" title=" robust optimization"> robust optimization</a>, <a href="https://publications.waset.org/search?q=Stochastic%20Programming" title=" Stochastic Programming"> Stochastic Programming</a>, <a href="https://publications.waset.org/search?q=variable%20neighborhood%20search." title=" variable neighborhood search."> variable neighborhood search.</a> </p> <a href="https://publications.waset.org/10009174/a-robust-optimization-model-for-the-single-depot-capacitated-location-routing-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10009174/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10009174/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10009174/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10009174/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10009174/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10009174/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10009174/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10009174/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10009174/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10009174/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10009174.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">755</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2449</span> Optimizing Performance of Tablet's Direct Compression Process Using Fuzzy Goal Programming</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Abbas%20Al-Refaie">Abbas Al-Refaie</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This paper aims at improving the performance of the tableting process using statistical quality control and fuzzy goal programming. The tableting process was studied. Statistical control tools were used to characterize the existing process for three critical responses including the averages of a tablet’s weight, hardness, and thickness. At initial process factor settings, the estimated process capability index values for the tablet’s averages of weight, hardness, and thickness were 0.58, 3.36, and 0.88, respectively. The L<sub>9</sub> array was utilized to provide experimentation design. Fuzzy goal programming was then employed to find the combination of optimal factor settings. Optimization results showed that the process capability index values for a tablet’s averages of weight, hardness, and thickness were improved to 1.03, 4.42, and 1.42, respectively. Such improvements resulted in significant savings in quality and production costs.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Fuzzy%20goal%20programming" title="Fuzzy goal programming">Fuzzy goal programming</a>, <a href="https://publications.waset.org/search?q=control%20charts" title=" control charts"> control charts</a>, <a href="https://publications.waset.org/search?q=process%20capability" title=" process capability"> process capability</a>, <a href="https://publications.waset.org/search?q=tablet%20optimization." title=" tablet optimization."> tablet optimization.</a> </p> <a href="https://publications.waset.org/10007010/optimizing-performance-of-tablets-direct-compression-process-using-fuzzy-goal-programming" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10007010/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10007010/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10007010/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10007010/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10007010/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10007010/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10007010/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10007010/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10007010/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10007010/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10007010.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">1004</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2448</span> Approximate Solution of Nonlinear Fredholm Integral Equations of the First Kind via Converting to Optimization Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Akbar%20H.%20Borzabadi">Akbar H. Borzabadi</a>, <a href="https://publications.waset.org/search?q=Omid%20S.%20Fard"> Omid S. Fard</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper we introduce an approach via optimization methods to find approximate solutions for nonlinear Fredholm integral equations of the first kind. To this purpose, we consider two stages of approximation. First we convert the integral equation to a moment problem and then we modify the new problem to two classes of optimization problems, non-constraint optimization problems and optimal control problems. Finally numerical examples is proposed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Fredholm%20integral%20equation" title="Fredholm integral equation">Fredholm integral equation</a>, <a href="https://publications.waset.org/search?q=Optimization%20method" title=" Optimization method"> Optimization method</a>, <a href="https://publications.waset.org/search?q=Optimal%20control" title=" Optimal control"> Optimal control</a>, <a href="https://publications.waset.org/search?q=Nonlinear%20and%20linear%20programming" title=" Nonlinear and linear programming"> Nonlinear and linear programming</a> </p> <a href="https://publications.waset.org/3092/approximate-solution-of-nonlinear-fredholm-integral-equations-of-the-first-kind-via-converting-to-optimization-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/3092/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/3092/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/3092/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/3092/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/3092/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/3092/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/3092/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/3092/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/3092/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/3092/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/3092.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">1773</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2447</span> Partial Derivatives and Optimization Problem on Time Scales</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Francisco%20Miranda">Francisco Miranda</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The optimization problem using time scales is studied. Time scale is a model of time. The language of time scales seems to be an ideal tool to unify the continuous-time and the discrete-time theories. In this work we present necessary conditions for a solution of an optimization problem on time scales. To obtain that result we use properties and results of the partial diamond-alpha derivatives for continuous-multivariable functions. These results are also presented here. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Lagrange%20multipliers" title="Lagrange multipliers">Lagrange multipliers</a>, <a href="https://publications.waset.org/search?q=mathematical%20programming" title=" mathematical programming"> mathematical programming</a>, <a href="https://publications.waset.org/search?q=optimization%20problem" title=" optimization problem"> optimization problem</a>, <a href="https://publications.waset.org/search?q=time%20scales." title=" time scales."> time scales.</a> </p> <a href="https://publications.waset.org/3965/partial-derivatives-and-optimization-problem-on-time-scales" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/3965/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/3965/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/3965/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/3965/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/3965/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/3965/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/3965/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/3965/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/3965/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/3965/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/3965.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">1725</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2446</span> Determining Optimal Demand Rate and Production Decisions: A Geometric Programming Approach</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Farnaz%20G.%20Nezami">Farnaz G. Nezami</a>, <a href="https://publications.waset.org/search?q=Mir%20B.%20Aryanezhad"> Mir B. Aryanezhad</a>, <a href="https://publications.waset.org/search?q=Seyed%20J.%20Sadjadi"> Seyed J. Sadjadi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper a nonlinear model is presented to demonstrate the relation between production and marketing departments. By introducing some functions such as pricing cost and market share loss functions it will be tried to show some aspects of market modelling which has not been regarded before. The proposed model will be a constrained signomial geometric programming model. For model solving, after variables- modifications an iterative technique based on the concept of geometric mean will be introduced to solve the resulting non-standard posynomial model which can be applied to a wide variety of models in non-standard posynomial geometric programming form. At the end a numerical analysis will be presented to accredit the validity of the mentioned model. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Geometric%20programming" title="Geometric programming">Geometric programming</a>, <a href="https://publications.waset.org/search?q=marketing" title=" marketing"> marketing</a>, <a href="https://publications.waset.org/search?q=nonlinear%0Aoptimization" title=" nonlinear optimization"> nonlinear optimization</a>, <a href="https://publications.waset.org/search?q=production." title=" production."> production.</a> </p> <a href="https://publications.waset.org/5173/determining-optimal-demand-rate-and-production-decisions-a-geometric-programming-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/5173/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/5173/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/5173/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/5173/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/5173/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/5173/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/5173/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/5173/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/5173/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/5173/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/5173.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">1435</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2445</span> New Fuzzy Preference Relations and its Application in Group Decision Making</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Nur%20Syibrah%20Muhamad%20Naim">Nur Syibrah Muhamad Naim</a>, <a href="https://publications.waset.org/search?q=Mohd%20Lazim%20Abdullah"> Mohd Lazim Abdullah</a>, <a href="https://publications.waset.org/search?q=Che%20Mohd%20Imran%20Che%20Taib"> Che Mohd Imran Che Taib</a>, <a href="https://publications.waset.org/search?q=Abu%20OsmanMd.%20Tap"> Abu OsmanMd. Tap</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Decision making preferences to certain criteria usually focus on positive degrees without considering the negative degrees. However, in real life situation, evaluation becomes more comprehensive if negative degrees are considered concurrently. Preference is expected to be more effective when considering both positive and negative degrees of preference to evaluate the best selection. Therefore, the aim of this paper is to propose the conflicting bifuzzy preference relations in group decision making by utilization of a novel score function. The conflicting bifuzzy preference relation is obtained by introducing some modifications on intuitionistic fuzzy preference relations. Releasing the intuitionistic condition by taking into account positive and negative degrees simultaneously and utilizing the novel score function are the main modifications to establish the proposed preference model. The proposed model is tested with a numerical example and proved to be simple and practical. The four-step decision model shows the efficiency of obtaining preference in group decision making. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Fuzzy%20preference%20relations" title="Fuzzy preference relations">Fuzzy preference relations</a>, <a href="https://publications.waset.org/search?q=score%20function" title=" score function"> score function</a>, <a href="https://publications.waset.org/search?q=conflicting%20bifuzzy" title="conflicting bifuzzy">conflicting bifuzzy</a>, <a href="https://publications.waset.org/search?q=decision%20making." title=" decision making."> decision making.</a> </p> <a href="https://publications.waset.org/2189/new-fuzzy-preference-relations-and-its-application-in-group-decision-making" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/2189/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/2189/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/2189/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/2189/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/2189/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/2189/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/2189/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/2189/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/2189/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/2189/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/2189.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">1432</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2444</span> 4D Flight Trajectory Optimization Based on Pseudospectral Methods</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Kouamana%20Bousson">Kouamana Bousson</a>, <a href="https://publications.waset.org/search?q=Paulo%20Machado"> Paulo Machado</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The optimization and control problem for 4D trajectories is a subject rarely addressed in literature. In the 4D navigation problem we define waypoints, for each mission, where the arrival time is specified in each of them. One way to design trajectories for achieving this kind of mission is to use the trajectory optimization concepts. To solve a trajectory optimization problem we can use the indirect or direct methods. The indirect methods are based on maximum principle of Pontryagin, on the other hand, in the direct methods it is necessary to transform into a nonlinear programming problem. We propose an approach based on direct methods with a pseudospectral integration scheme built on Chebyshev polynomials. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Pseudospectral%20Methods" title="Pseudospectral Methods">Pseudospectral Methods</a>, <a href="https://publications.waset.org/search?q=Trajectory%20Optimization" title=" Trajectory Optimization"> Trajectory Optimization</a>, <a href="https://publications.waset.org/search?q=4DTrajectories" title=" 4DTrajectories"> 4DTrajectories</a> </p> <a href="https://publications.waset.org/11036/4d-flight-trajectory-optimization-based-on-pseudospectral-methods" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/11036/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/11036/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/11036/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/11036/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/11036/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/11036/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/11036/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/11036/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/11036/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/11036/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/11036.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">2411</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2443</span> A Parametric Study of an Inverse Electrostatics Problem (IESP) Using Simulated Annealing, Hooke & Jeeves and Sequential Quadratic Programming in Conjunction with Finite Element and Boundary Element Methods</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Ioannis%20N.%20Koukoulis">Ioannis N. Koukoulis</a>, <a href="https://publications.waset.org/search?q=Clio%20G.%20Vossou"> Clio G. Vossou</a>, <a href="https://publications.waset.org/search?q=Christopher%20G.%20Provatidis"> Christopher G. Provatidis</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The aim of the current work is to present a comparison among three popular optimization methods in the inverse elastostatics problem (IESP) of flaw detection within a solid. In more details, the performance of a simulated annealing, a Hooke & Jeeves and a sequential quadratic programming algorithm was studied in the test case of one circular flaw in a plate solved by both the boundary element (BEM) and the finite element method (FEM). The proposed optimization methods use a cost function that utilizes the displacements of the static response. The methods were ranked according to the required number of iterations to converge and to their ability to locate the global optimum. Hence, a clear impression regarding the performance of the aforementioned algorithms in flaw identification problems was obtained. Furthermore, the coupling of BEM or FEM with these optimization methods was investigated in order to track differences in their performance.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Elastostatic" title="Elastostatic">Elastostatic</a>, <a href="https://publications.waset.org/search?q=inverse%20problem" title=" inverse problem"> inverse problem</a>, <a href="https://publications.waset.org/search?q=optimization." title=" optimization."> optimization.</a> </p> <a href="https://publications.waset.org/14773/a-parametric-study-of-an-inverse-electrostatics-problem-iesp-using-simulated-annealing-hooke-jeeves-and-sequential-quadratic-programming-in-conjunction-with-finite-element-and-boundary-element-methods" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/14773/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/14773/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/14773/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/14773/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/14773/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/14773/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/14773/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/14773/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/14773/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/14773/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/14773.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">1874</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2442</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/search?q=Ivan%20Stanev">Ivan Stanev</a>, <a href="https://publications.waset.org/search?q=Maria%20Koleva"> Maria Koleva</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Common Platform for Automated Programming (CPAP) is defined in details. Two versions of CPAP are described: Cloud based (including set of components for classic programming, and set of components for combined programming); and Knowledge Based Automated Software Engineering (KBASE) based (including set of components for automated programming, and 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/search?q=Automated%20Programming" title="Automated Programming">Automated Programming</a>, <a href="https://publications.waset.org/search?q=Cloud%20Computing" title=" Cloud Computing"> Cloud Computing</a>, <a href="https://publications.waset.org/search?q=Knowledge%20Based%20Software%20Engineering" title=" Knowledge Based Software Engineering"> Knowledge Based Software Engineering</a>, <a href="https://publications.waset.org/search?q=Service%20Oriented%0D%0AArchitecture." title=" Service Oriented Architecture."> Service Oriented Architecture.</a> </p> <a href="https://publications.waset.org/10003125/a-common-automated-programming-platform-for-knowledge-based-software-engineering" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10003125/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10003125/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10003125/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10003125/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10003125/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10003125/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10003125/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10003125/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10003125/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10003125/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10003125.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">1889</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/search?q=preference%20optimization%20programming&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=preference%20optimization%20programming&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=preference%20optimization%20programming&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=preference%20optimization%20programming&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=preference%20optimization%20programming&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=preference%20optimization%20programming&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=preference%20optimization%20programming&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=preference%20optimization%20programming&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=preference%20optimization%20programming&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/search?q=preference%20optimization%20programming&page=82">82</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=preference%20optimization%20programming&page=83">83</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=preference%20optimization%20programming&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>