Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 8 of 8 for “"bilevel programming"”.

  1. Methods Of Variational Analysis In Pessimistic Bilevel Programming

    <p>Bilevel programming problems are of growing interest both from theoretical and practical points of view. These models are used in various applications, such as economic planning, network design, and so on. The purpose of this dissertation is to study the pessimistic (or strong) version of …

    wayne-thes Repository record for Methods Of Variational Analysis In Pessimistic Bilevel Programming (opens in a new tab)

  2. Implementation and evaluation of nonlinear bilevel programming model of equilibrium network design problem

    … investment decision making process using a bilevel nonlinear programming model of the continuous equilibrium network design problem. Toward this end, a descent type algorithm for solving the continuous equilibrium network design problem is proposed and the performance of the algorithm is …

    uiuc Repository record for Implementation and evaluation of nonlinear bilevel programming model of equilibrium network design problem (opens in a new tab)

  3. The Productivity Trap in Kenya's Highland Agriculture: A Bilevel Programming Analysis of Credit and Wage Constraints

    Much of the less developed world faces the problems of feeding an ever increasing population. Improved agricultural productivity is the key to improved food security and economic returns in these regions. Much of the necessary improvement in productivity is a function of improved factors of …

    uiuc Repository record for The Productivity Trap in Kenya's Highland Agriculture: A Bilevel Programming Analysis of Credit and Wage Constraints (opens in a new tab)

  4. Effects of economic transition policies on Yugoslavia's agricultural sector: A quantitative approach

    … performance (output) of the agricultural sector. Bilevel programming is used as the methodology because it recognizes different objectives of policy makers (government) at the upper-level, and state and private farms at the lower-level. The results of the research indicate that economic reasons …

    uiuc Repository record for Effects of economic transition policies on Yugoslavia's agricultural sector: A quantitative approach (opens in a new tab)

  5. Dynamic pricing with demand learning under competition

    … We show that the problem can be formulated as a bilevel program in disequilibrium and as a Mathematical Program with Equilibrium Constraints (MPECs) in equilibrium. Using results from variational inequalities, bilevel programming and MPECs, we prove that learning the optimal strategies as well as …

    mit Repository record for Dynamic pricing with demand learning under competition (opens in a new tab)

  6. Multidelity methods for multidisciplinary system design

    … approach treats the system design problem as a bilevel programming problem and enables each subsystem to be designed concurrently. The second approach optimizes surrogate models of each discipline that are all constructed in parallel. Both multidisciplinary approaches use multifidelity …

    mit Repository record for Multidelity methods for multidisciplinary system design (opens in a new tab)

  7. Optimal Design and Analysis of Bio-inspired, Curvilinearly Stiffened Composite Flexible Wings

    … for designing models used in the PAAW program. A bilevel programming (BLP) multidisciplinary design optimization (MDO) architecture is developed for the MDAO framework. The upper-level optimization problem entails minimization of weight, drag and ground roll distance, all subjected to both static …

    vt Repository record for Optimal Design and Analysis of Bio-inspired, Curvilinearly Stiffened Composite Flexible Wings (opens in a new tab)

  8. Optimally Locating Facilities with Variable Characteristics

    … the first one as a mixed-integer nonlinear programming problem and propose three methods for its solution: a Lagrangean heuristic, a branch-and-bound method with Lagrangean relaxation, and a branch-and-bound method with nonlinear programming relaxation. The computational results obtained on …

    liege Repository record for Optimally Locating Facilities with Variable Characteristics (opens in a new tab)