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 20 of 30 for “"cutting plane method"”.

  1. FINITE DISJUNCTIVE PROGRAMMING METHODS FOR GENERAL MIXED INTEGER LINEAR PROGRAMS

    … program. The standard notion of sequential cutting planes is then combined with ideasunderlying the CHT algorithm to help guide the choice of disjunctions to use within a new cutting plane method, the Cutting Plane Tree (CPT) algorithm. We show that the CPT algorithm converges to an integer …

    arizona-thes Repository record for FINITE DISJUNCTIVE PROGRAMMING METHODS FOR GENERAL MIXED INTEGER LINEAR PROGRAMS (opens in a new tab)

  2. Interior Point Cutting Plane Methods in Integer Programming

    … Particularly, we use the analytic center cutting plane method to improve three of the main components of the branch-and-bound algorithm: cutting planes, heuristics, and branching. First, we present an interior point branch-and-cut algorithm for structured integer programs based on Benders …

    waterloo Repository record for Interior Point Cutting Plane Methods in Integer Programming (opens in a new tab)

  3. Stochastic programming models and methods for portfolio optimization and risk management

    This project is focused on stochastic models and methods and their application in portfolio optimization and risk management. In particular it involves development and analysis of novel numerical methods for solving these types of problem. First, we study new numerical methods for a general second …

    soton Download PDF for Stochastic programming models and methods for portfolio optimization and risk management (opens in a new tab)

  4. An integer polyhedron related to the design of survivable communication networks.

    The linear programming cutting plane method has proven to be quite successful for solving certain "hard" combinatorial optimization problems, c.f. (1), (6), (12), (24), (26). A great deal of this success is due to the use of problem specific cutting planes which define facets of the underlying …

    ottawa-retro Repository record for An integer polyhedron related to the design of survivable communication networks. (opens in a new tab)

  5. Tight Probability Bounds for Hausdorff Random Variables with Applications to Optimal Cancer Radiotherapy Treatment Design

    … probability bounds, and propose a numerical method to better position such shifts. In addition, when only a few raw and shifted moments are known, we derive novel extensions of the Markov and Chebyshev bounds. Motivated by the problem of optimal radiotherapy treatment design, we present a …

    calgary Repository record for Tight Probability Bounds for Hausdorff Random Variables with Applications to Optimal Cancer Radiotherapy Treatment Design (opens in a new tab)

  6. Two-Echelon Supply Chain Design for Spare Parts with Time Constraints

    … integer non-linear programming model and use cutting-plane method to optimize the inventory-location decisions. We present an exact solution procedure for the inventory stocking problem and demonstrate the limitations of using traditional inventory models like METRIC-like and Approximate in …

    waterloo Repository record for Two-Echelon Supply Chain Design for Spare Parts with Time Constraints (opens in a new tab)

  7. A polyhedral approach to designing communication networks.

    … facet-inducing inequalities instead of dominant cutting-planes, the linear programming cutting-plane method has proven to be quite successful for solving some NP-hard combinatorial optimization problems. We believe that our new classes of facet-inducing inequalities can be used to further improve …

    ottawa-retro Repository record for A polyhedral approach to designing communication networks. (opens in a new tab)

  8. An Adjustable Robust Optimization Approach to Multi-objective Personnel Scheduling Under Uncertain Demand: A Case Study at a Pathology Department

    … approach solves the proposed model through a cutting plane strategy known as Benders dual cutting plane method, and the second approach reformulates the problem based on the strong duality theory. As a case study, the proposed model and the first solution approach are applied to an existing …

    ottawa-retro Repository record for An Adjustable Robust Optimization Approach to Multi-objective Personnel Scheduling Under Uncertain Demand: A Case Study at a Pathology Department (opens in a new tab)

  9. The Traveling Salesman Subset-tour Problem with one additional constraint (TSSP+1)

    … a <b>L</b>inear <b>P</b>rogramming (LP)-based cutting plane method for bounding within the branch-and-cut algorithm. The cutting plane method utilizes linear programming to solve a relaxed version of the problem and uses specialized algorithms to identify violated constraints. The violated …

    utk-theses Repository record for The Traveling Salesman Subset-tour Problem with one additional constraint (TSSP+1) (opens in a new tab)

  10. New valid inequalities for a time-indexed formulation of the flexible job shop scheduling problem

    … testing. This has been performed using a cutting-plane method on Fattahi test instances, both with the objective of minimizing makespan as well as minimizing tardiness. For both objectives the new valid inequalities have yielded improved lower bounds, however with varying effect. …

    chalmers Repository record for New valid inequalities for a time-indexed formulation of the flexible job shop scheduling problem (opens in a new tab)

  11. Empirical Analysis of Algorithms for Block-Angular Linear Programs

    … research: first, the Dantzig-Wolfe decomposition method (DW) versus the simplex method (simplex); second, the analytic center cutting plane method (ACCPM) versus the interior point method (IPM). These comparisons fall into the two main solution approaches in linear programming: simplex-based …

    waterloo Repository record for Empirical Analysis of Algorithms for Block-Angular Linear Programs (opens in a new tab)

  12. Optimization of a One-story Two-bay Steel Frame with Haunches by Linear Programming

    … The linear equations used in the simplex method of analysis were approximated by applying Taylor's first order of expansion theorem to the nonlinear constraint equations and the objective function. This technique of approximation is known as the cutting plane method. After each …

    sdstate Repository record for Optimization of a One-story Two-bay Steel Frame with Haunches by Linear Programming (opens in a new tab)

  13. Multi-Agent Integer Programming Games with Non-Cooperation and Cooperation

    … guarantee and hybridized with the zero-regret cutting-plane method (BZR), lifting tractable PNE computation and sampling from a handful of players to dozens; the methods are instantiated on edge-weighted budgeted maximum coverage games, including a Minnesota aquatic invasive species (AIS) …

    vt Repository record for Multi-Agent Integer Programming Games with Non-Cooperation and Cooperation (opens in a new tab)

  14. New Benders' Decomposition Approaches for W-CDMA Telecommunication Network Design

    … The first extension uses the analytic center cutting plane method for the Benders master problem, in an attempt to reduce the number of times the integer Benders master problem is solved. Additionally, we describe a heuristic that uses the analytic center properties to find feasible solutions …

    waterloo Repository record for New Benders' Decomposition Approaches for W-CDMA Telecommunication Network Design (opens in a new tab)

  15. Efficient Algorithms for Solving Facility Problems with Disruptions

    … reliable facility location models and solution methods have been proposed under different assumptions of the disruption distribution. In most of these models, the disruption distribution is assumed to be completely known, that is, the disruptions are known to be uncorrelated or to follow a …

    utk-theses Repository record for Efficient Algorithms for Solving Facility Problems with Disruptions (opens in a new tab)

  16. Limited Memory Space Dilation and Reduction Algorithms

    … memory updates for differentiable quasi-Newton methods. This well known r-algorithm, which employs a space dilation strategy in the direction of the difference between two successive subgradients, is recognized as being one of the most effective procedures for solving nondifferentiable …

    vt Repository record for Limited Memory Space Dilation and Reduction Algorithms (opens in a new tab)

  17. Sequential Decision-making Under Uncertainty: Novel Methodologies and Applications

    … The goal of this thesis is to expand the methodological aspects of these two techniques, and in turn their applications. First, we study MSMIP problems, which can be approximated by using certain policies, e.g., linear decision rules. However, directly applying this idea to problems with …

    toronto-retro Repository record for Sequential Decision-making Under Uncertainty: Novel Methodologies and Applications (opens in a new tab)

  18. Extension of Chvátal-Gomory Closure via K-Halfspace closure

    … closure is analyzed. Here, we analyze the method of computing the convex hull of integer points by using the intersection of k-halfspaces as cutting planes. We prove that there exists examples where there is a significant improvement between the number of three-halfspace closure operations …

    jhu Repository record for Extension of Chvátal-Gomory Closure via K-Halfspace closure (opens in a new tab)

  19. Risk-averse Nash equilibria for power trading with market frictions

    … of solutions. We introduce a new numerical method that combines the dual extrapolation method with the cutting plane method. This method is shown to be efficient by means of careful numerical experiments.</p>

    oxford Repository record for Risk-averse Nash equilibria for power trading with market frictions (opens in a new tab)

  20. EXPLORING AND EXPLOITING STRUCTURE IN LARGE SCALE SIMULATION OPTIMIZATION

    … The first idea involves developing numerical methods to detect the structure of convexity in the output function of a simulation. The second idea exploits simulation traces to generate gradient-like information to guide optimization. The goal of this thesis is to provide insights on solving …

    cornell Repository record for EXPLORING AND EXPLOITING STRUCTURE IN LARGE SCALE SIMULATION OPTIMIZATION (opens in a new tab)

Page 1 of 2