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 129 for “"Valid Inequalities"”.

  1. New valid inequalities for knapsack and fixed-charge problems

    … ingredients to this success is the use of strong valid linear inequalities, also known as cutting planes. A key concept is that the convex hull of feasible solutions forms a polyhedron. One strand of the literature on cutting planes is concerned with the knapsack polytope. In the 1970s, Balas and …

    lancaster Download PDF for New valid inequalities for knapsack and fixed-charge problems (opens in a new tab)

  2. Formulations and valid inequalities for Economic Lot Sizing Problems with Remanufacturing (ELSR)

    … bounds for both problems, namely (?, S) - like inequalities and reformulation techniques, such as facility location (FL) reformulation, multi-commodity (MC) reformulation, and shortest path (SP) reformulation. Both theoretical and computational comparisons of different lower bounding techniques …

    strathclyde Repository record for Formulations and valid inequalities for Economic Lot Sizing Problems with Remanufacturing (ELSR) (opens in a new tab)

  3. Valid Inequalities and Facets for Multi-Module (Survivable) Capacitated Network Design Problem

    … generates the family of the so-called cutset inequalities based on the traditional mixed integer rounding (MIR). We then introduce a new family of inequalities for MMND based on the so-called n-step MIR, and show that various classes of cutset inequalities in the literature are special cases …

    tamu Repository record for Valid Inequalities and Facets for Multi-Module (Survivable) Capacitated Network Design Problem (opens in a new tab)

  4. Valid inequalities and computational results for SOS1-, SOS2-, and cardinality-constrained linear programs

    In this dissertation, we consider three types of constraints that are frequently used in mixed integer programming (MIP), namely: SOS1, SOS2, and cardinality. We study and develop cutting planes for those types of constraints, and use them within branch-and-cut to solve difficult MIP instances. Our …

    ttu Repository record for Valid inequalities and computational results for SOS1-, SOS2-, and cardinality-constrained linear programs (opens in a new tab)

  5. Discrete and Continuous Nonconvex Optimization: Decision Trees, Valid Inequalities, and Reduced Basis Techniques

    … programming problems, through the generation of valid inequalities and reduced representations, along with the design and implementation of efficient algorithms. We first conduct a quantitative analysis for a strategic risk management problem that involves allocating certain available …

    vt Repository record for Discrete and Continuous Nonconvex Optimization: Decision Trees, Valid Inequalities, and Reduced Basis Techniques (opens in a new tab)

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

    In this thesis a family of valid inequalities originally formulated for single- and parallel machine scheduling problems are extended to a time-indexed, mixed integer linear programming formulation of the exible job shop scheduling problem. The model of the exible job shop scheduling problem that …

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

  7. Branch-and-cut for complementarity-constrained linear programs

    … variables are kept in the model. We will derive valid inequalities (called cutting planes) for the convex hull of the feasible set, which are then added to the cut pool in a branch-and-cut algorithm. We will present three families of valid inequalities, two of which are obtained by lifting valid …

    ttu Repository record for Branch-and-cut for complementarity-constrained linear programs (opens in a new tab)

  8. On the Polyhedral Lift-and-Project Rank Conjecture for the Fractional Stable Set Polytope

    … we look at the algebraic derivation of new valid inequalities by the operators N and N_0. We then present algebraic characterizations of these valid inequalities. Tightly based on our algebraic characterizations, we give an alternate proof of a result of Lovasz and Schrijver, establishing …

    waterloo Repository record for On the Polyhedral Lift-and-Project Rank Conjecture for the Fractional Stable Set Polytope (opens in a new tab)

  9. A new polyhedral approach to combinatorial designs

    … polyhedron dimension. We generate new classes of valid inequalities to aim at approximating this integer program by a linear program that has the same optimal solution. Some new classes of valid inequalities are generated as Chv´atal-Gomory cuts, other classes are generated by graph complements …

    tamu Repository record for A new polyhedral approach to combinatorial designs (opens in a new tab)

  10. Decision-Focused Learning for Efficient and Interpretable Mixed-Integer Optimization

    … optimization formulations through learned valid inequalities, and (iii) infer hidden decision-making objectives from observed decisions. In the first part of this thesis, we propose a decision-focused framework for constructing surrogate optimization models in the form of linear programs …

    umn Repository record for Decision-Focused Learning for Efficient and Interpretable Mixed-Integer Optimization (opens in a new tab)

  11. Integer programming approaches to networks with equal-split restrictions

    … linear programming formulation for this problem. Valid inequalities are obtained, and are incorporated within a branch-and-cut framework to solve the problem. We provide fast separation schemes for most of the families of valid inequalities. Computational results are presented to show the …

    gatech Repository record for Integer programming approaches to networks with equal-split restrictions (opens in a new tab)

  12. Pairing inequalities and stochastic lot-sizing problems: A study in integer programming

    … of the problem and develop a family of valid inequalities, called the (Q, S) inequalities. We establish facet-defining conditions and show that these inequalities are sufficient to describe the convex hull of integral solutions for two-period instances. A separation heuristic for (Q, S) …

    gatech Repository record for Pairing inequalities and stochastic lot-sizing problems: A study in integer programming (opens in a new tab)

  13. Mixed n-Step MIR Inequalities, n-Step Conic MIR Inequalities and a Polyhedral Study of Single Row Facility Layout Problem

    … this dissertation, we introduce new families of valid inequalities for general linear mixed integer programs (MIPs) and second-order conic MIPs (SOCMIPs) and establish several theoretical properties and computational effectiveness of these inequalities. First we introduce the mixed n-step mixed …

    tamu Repository record for Mixed n-Step MIR Inequalities, n-Step Conic MIR Inequalities and a Polyhedral Study of Single Row Facility Layout Problem (opens in a new tab)

  14. Facets for Continuous Multi-Mixing Set and Its Generalizations: Strong Cuts for Multi-Module Capacitated Lot-Sizing Problem

    … dissertation is to develop new facet-defining valid inequalities for several new multi-parameter multi-constraint mixed integer sets. These valid inequalities result in cutting planes that significantly improve the efficiency of algorithms for solving mixed integer programming (MIP) problems …

    tamu Repository record for Facets for Continuous Multi-Mixing Set and Its Generalizations: Strong Cuts for Multi-Module Capacitated Lot-Sizing Problem (opens in a new tab)

  15. Relaxações convexas e desigualdades válidas para o problema da mochila quadrático binário

    … quadratic problems. Finally, we propose new valid inequalities on the lifted matrix variable, derived from cover and knapsack inequalities for the QKP, and present the separation problems to generate cuts for the current solution of the CQP relaxation. Our best bounds are obtained from …

    brazil-uerj Repository record for Relaxações convexas e desigualdades válidas para o problema da mochila quadrático binário (opens in a new tab)

  16. Mixed integer bilinear programming with applications to the pooling problem

    … is proposed for the pooling problem. Linear valid inequalities in the original space of variables are derived using a well-known technique called lifting. Mixed integer linear (MILP) formulations are proposed for generating feasible solutions to the pooling problem. Some of these MILP models …

    gatech Repository record for Mixed integer bilinear programming with applications to the pooling problem (opens in a new tab)

  17. Hybrid robust and stochastic optimization for closed-loop supply chain network design using accelerated Benders decomposition

    … To speed up the convergence of this algorithm, valid inequalities are introduced to improve the quality of lower bound, and also a Pareto-optimal cut generation scheme is used to strengthen the Benders optimality cuts.</p> <p>Numerical studies are performed to verify our mathematical formulation …

    iastate Repository record for Hybrid robust and stochastic optimization for closed-loop supply chain network design using accelerated Benders decomposition (opens in a new tab)

  18. The polyhedral structure of certain combinatorial optimization problems with application to a naval defense problem

    … lifting procedures of minimal GUS cover inequalities. Second, we develop a new family of cutting planes for the set partitioning polytope for deleting any fractional basic feasible solutions to its underlying linear programming relaxation. We also show that all the known classes of valid …

    vt Repository record for The polyhedral structure of certain combinatorial optimization problems with application to a naval defense problem (opens in a new tab)

  19. Optimization Methods for Cluster Analysis in Network-based Data Mining

    … We derive several families of facet-defining valid inequalities for the IUC polytope associated with a graph. We also provide a complete description of this polytope for some special classes of graphs. We establish computational complexity of the separation problems for most of the considered …

    tamu Repository record for Optimization Methods for Cluster Analysis in Network-based Data Mining (opens in a new tab)

Page 1 of 7