Mixed logical-linear programming
From MaRDI portal
Theoretical and algorithmic aspects and applications of mixed logical linear programming are discussed. This is an extension of mixed integer linear programming, and the model has the following form: \[ \min cx\text{ s.t. }p_j(y,h)\to (A^jx\geq a^j),\;j\in J,\;q_i(y,h),\;i\in I. \] \(y\) is a set of logical variables and \(h\) is a set of discrete variables, combined by logical and arithmetical operations respectively. As an example \(q_i(y,h)\) could be \((y_1\vee y_2)\wedge(h_1\neq h_2)\). A system \(A^jx\geq a^j\) is enforced when \(p_j(y,h)\) is true, and this is the continuous part. \((x,y,h)\) is then feasible if \((y,h)\) makes all \(q_i(y,h)\) true and \(x\) satisfies the linear systems corresponding to the formulas \(p_j(y,h)\) that \((y,h)\) makes true.
Recommendations
Cites work
- A Comparison of Constraint and Mixed-Integer Programming Solvers for Batch Sequencing with Sequence-Dependent Setups
- A Machine-Oriented Logic Based on the Resolution Principle
- A note on duality in disjunctive programming
- A Way to Simplify Truth Functions
- An algorithm for disjunctive programs
- An algorithm for solving large capacitated warehouse location problems
- An alternative explanation of disjunctive formulations
- An optimal k-consistency algorithm
- Compact normal forms in propositional logic and integer programming formulations
- Detecting embedded Horn structure in propositional logic
- Disjunctive Programming
- Extended Horn sets in propositional logic
- Fourier-Motzkin elimination extension to integer programming problems
- Generalized resolution for 0--1 linear inequalities
- Generating cuts in integer programming with families of special ordered sets
- scientific article; zbMATH DE number 3967882 (Why is no real title available?)
- scientific article; zbMATH DE number 3978351 (Why is no real title available?)
- scientific article; zbMATH DE number 3466489 (Why is no real title available?)
- scientific article; zbMATH DE number 3545380 (Why is no real title available?)
- scientific article; zbMATH DE number 408798 (Why is no real title available?)
- scientific article; zbMATH DE number 683337 (Why is no real title available?)
- scientific article; zbMATH DE number 976922 (Why is no real title available?)
- scientific article; zbMATH DE number 3249560 (Why is no real title available?)
- Input Proofs and Rank One Cutting Planes
- Logic applied to integer programming and integer programming applied to logic
- Logic cuts for processing networks with fixed charges
- Logic-based 0-1 constraint programming
- Logic-based Benders decomposition
- Logic-based decision support. Mixed integer model formulation
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- Modelling with integer variables
- On finding solutions for extended Horn formulas
- On renamable Horn and generalized Horn functions
- Optimal Design of Truss Structures by Logic-Based Branch and Cut
- Representability in mixed integer programming. I: Characterization results
- Resolution vs. cutting plane solution of inference problems: Some computational experience
- Solving a General Routing and Scheduling Problem by Chain Decomposition and Tabu Search
- Some results and experiments in programming techniques for propositional logic
- Surrogate Constraint Duality in Mathematical Programming
- Symbolic integration of logic in MILP branch and bound methods for the synthesis of process networks
- Testing heuristics: We have it all wrong
- The arborescence-realization problem
- The intractability of resolution
- The Problem of Simplifying Truth Functions
- Two Rules for Deducing Valid Inequalities for 0-1 Problems
Cited in
(31)- Modelling either-or relations in integer programming
- Logic cuts for multilevel generalized assignment problems.
- On solving the progressive party problem as a MIP.
- Mixed global constraints and inference in hybrid CLP--IP solvers
- Constraint programming and operations research
- Global optimization of disjunctive programs
- An interleaved depth-first search method for the linear optimization problem with disjunctive constraints
- Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression
- Many-valued logic and mixed integer programming
- Best subset selection via cross-validation criterion
- Semiring programming: a semantic framework for generalized sum product problems
- Zero duality gap in surrogate constraint optimization: a concise review of models
- Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm
- Solving linear programs with complementarity constraints using branch-and-cut
- Submodularity and its application to some global constraints
- A branch and efficiency algorithm for the optimal design of supply chain networks
- A polyhedral approach to the \textit{alldifferent} system
- Searching for mutually orthogonal Latin squares via integer and constraint programming
- Mixed integer linear programming formulation techniques
- Globally optimal clusterwise regression by column generation enhanced with heuristics, sequencing and ending subset optimization
- Solving disjunctive optimization problems by generalized semi-infinite optimization techniques
- scientific article; zbMATH DE number 4102512 (Why is no real title available?)
- Hybrid model predictive control of a solar air conditioning plant
- Ahybrid model (MILP-CLP) to pipeline operational scheduling
- Constraint Integer Programming: A New Approach to Integrate CP and MIP
- A conflict-directed approach to chance-constrained mixed logical linear programming
- Global and preference-based optimization with mixed variables using piecewise affine surrogates
- A generalized Benders decomposition approach for the optimal design of a local multi-energy system
- Logic-based modeling and solution of nonlinear discrete/continuous optimization problems
- A conditional logic approach for strengthening mixed 0-1 linear programs
- Second-order cover inequalities
This page was built for publication: Mixed logical-linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1961464)
