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 4 of 4 for “"nonconvex programming"”.

  1. Optimization of control device locations and sizes in mine ventilation systems

    … problem is formulated through a nonlinear nonconvex programming model. Using the special ordered sets variables, the nonconvex problem is linearized and then optimized by the modified branch and bound procedure where the automatic interpolation technique is used to improve the accuracy to …

    vt Repository record for Optimization of control device locations and sizes in mine ventilation systems (opens in a new tab)

  2. Lagrangian Relaxation / Dual Approaches For Solving Large-Scale Linear Programming Problems

    … research effort focuses on large-scale linear programming problems that arise in the context of solving various problems such as discrete linear or polynomial, and continuous nonlinear, nonconvex programming problems, using linearization and branch-and-cut algorithms for the discrete case, and …

    vt Repository record for Lagrangian Relaxation / Dual Approaches For Solving Large-Scale Linear Programming Problems (opens in a new tab)

  3. Global Optimization of Nonconvex Factorable Programs with Applications to Engineering Design Problems

    … optimization algorithm to solve a class of nonconvex programming problems, and to test it using a collection of engineering design problem applications.The class of problems we consider involves the optimization of a general nonconvex factorable objective function over a feasible region that …

    vt Repository record for Global Optimization of Nonconvex Factorable Programs with Applications to Engineering Design Problems (opens in a new tab)

  4. Video Communications over Dynamic Ad Hoc Networks

    … paths. This problem is formulated as a nonlinear nonconvex programming problem, for which a tight linear programming relaxation is constructed via the Reformulation-Linearization Technique (RLT). This construct is embedded within a specialized branch-and-bound algorithm to achieve global …

    vt Repository record for Video Communications over Dynamic Ad Hoc Networks (opens in a new tab)