Integer Programming in Parameterized Complexity: Three Miniatures

Powerful results from the theory of integer programming have recently led to substantial advances in parameterized complexity. However, our perception is that, except for Lenstra\u27s algorithm for solving integer linear programming in fixed dimension, there is still little understanding in the parameterized complexity community of the strengths and limitations of the available tools. This is understandable: it is often difficult to infer exact runtimes or even the distinction between FPT and XP algorithms, and some knowledge is simply unwritten folklore in a different community. We wish to make a step in remedying this situation. To that end, we first provide an easy to navigate quick reference guide of integer programming algorithms from the perspective of parameterized complexity. Then, we show their applications in three case studies, obtaining FPT algorithms with runtime f(k) poly(n). We focus on: - Modeling: since the algorithmic results follow by applying existing algorithms to new models, we shift the focus from the complexity result to the modeling result, highlighting common patterns and tricks which are used. - Optimality program: after giving an FPT algorithm, we are interested in reducing the dependence on the parameter; we show which algorithms and tricks are often useful for speed-ups. - Minding the poly(n): reducing f(k) often has the unintended consequence of increasing poly(n); so we highlight the common trade-offs and show how to get the best of both worlds. Specifically, we consider graphs of bounded neighborhood diversity which are in a sense the simplest of dense graphs, and we show several FPT algorithms for Capacitated Dominating Set, Sum Coloring, and Max-q-Cut by modeling them as convex programs in fixed dimension, n-fold integer programs, bounded dual treewidth programs, and indefinite quadratic programs in fixed dimension

Transformation of propositional calculus statements into integer and mixed integer programs: An approach towards automatic reformulation

A systematic procedure for transforming a set of logical statements or logical conditions imposed on a model into an Integer Linear Progamming (ILP) formulation Mixed Integer Programming (MIP) formulation is presented. An ILP stated as a system of linear constraints involving integer variables and an objective function, provides a powerful representation of decision problems through a tightly interrelated closed system of choices. It supports direct representation of logical (Boolean or prepositional calculus) expressions. Binary variables (hereafter called logical variables) are first introduced and methods of logically connecting these to other variables are then presented. Simple constraints can be combined to construct logical relationships and the methods of formulating these are discussed. A reformulation procedure which uses the extended reverse polish representation of a compound logical form is then described. These reformulation procedures are illustrated by two examples. A scheme of implementation.ithin an LP modelling system is outlined

Developments in linear and integer programming

In this review we describe recent developments in linear and integer (linear) programming. For over 50 years Operational Research practitioners have made use of linear optimisation models to aid decision making and over this period the size of problems that can be solved has increased dramatically, the time required to solve problems has decreased substantially and the flexibility of modelling and solving systems has increased steadily. Large models are no longer confined to large computers, and the flexibility of optimisation systems embedded in other decision support tools has made on-line decision making using linear programming a reality (and using integer programming a possibility). The review focuses on recent developments in algorithms, software and applications and investigates some connections between linear optimisation and other technologies

Effective Multi-echelon Inventory Systems for Supplier Selection and Order Allocation

Successful supply chain management requires an effective sourcing strategy to counteract uncertainties in both the suppliers and demands. Therefore, determining a better sourcing policy is critical in most of industries. Supplier selection is an essential task within the sourcing strategy. A well-selected set of suppliers makes a strategic difference to an organization\u27s ability to reduce costs and improve the quality of its end products. To discover the cost structure of selecting a supplier, it is more interesting to further determine appropriate levels of inventory in each echelon for different suppliers. This dissertation focuses on the study of the integrated supplier selection, order allocation and inventory control problems in a multi-echelon supply chain. First, we investigate a non-order-splitting inventory system in supply chain management. In particular, a buyer firm that consists of one warehouse and N identical retailers procures a type of product from a group of potential suppliers, which may have different prices, ordering costs, lead times and have restriction on minimum and maximum total order size, to satisfy stochastic demand. A continuous review system that implements the order quantity, reorder point (Q, R) inventory policy is considered in the proposed model. The model is solved by decomposing the mixed integer nonlinear programming model into two sub-models. Numerical experiments are conducted to evaluate the model and some managerial insights are obtained with sensitivity analysis. In the next place, we extend the study to consider the multi-echelon system with the order-splitting policy. In particular, the warehouse acquisition takes place when the inventory level depletes to a reorder point R, and the order Q is simultaneously split among m selected suppliers. This consideration is important since it could pool lead time risks by splitting replenishment orders among multiple suppliers simultaneously. We develop an exact analysis for the order-splitting model in the multi-echelon system, and formulate the problem in a Mixed Integer Nonlinear Programming (MINLP) model. To demonstrate the solvability and the effectiveness of the model, we conduct several numerical analyses, and further conduct simulation models to verify the correctness of the proposed mathematical model

Tools for reformulating logical forms into zero-one mixed integer programs (MIPS)

A systematic procedure for transforming a set of logical statements or logical conditions imposed on a model into an Integer Linear Programming (ILP) formulation or a Mixed Integer Programming (MIP) formulation is presented. A reformulation procedure which uses the extended reverse polish representation of a compound logical form is then described. A prototype user interface by which logical forms can be reformulated and the corresponding MIP constructed and analysed within an existing Mathematical Programming modelling system is illustrated. Finally, the steps to formulate a discrete optimisation model in this way are demonstrated by means of an example