Unbounded convex sets for non-convex mixed-integer quadratic programming

This paper introduces a fundamental family of unbounded convex sets that arises in the context of non-convex mixed-integer quadratic programming. It is shown that any mixed-integer quadratic program with linear constraints can be reduced to the minimisation of a linear function over a face of a set in the family. Some fundamental properties of the convex sets are derived, along with connections to some other well-studied convex sets. Several classes of valid and facet-inducing inequalities are also derived

A Comparison of Mixed-Integer Programming Models for Non-Convex Piecewise Linear Cost Minimization Problems

We study a generic minimization problem with separable non-convex piecewise linear costs, showing that the linear programming (LP) relaxation of three textbook mixed integer programming formulations each approximates the cost function by its lower convex envelope. We also show a relationship between this result and classical Lagrangian duality theory

Optimal arrangements of hyperplanes for multiclass classification

In this paper, we present a novel approach to construct multiclass classifiers by means of arrangements of hyperplanes. We propose different mixed integer (linear and non linear) programming formulations for the problem using extensions of widely used measures for misclassifying observations where the \textit{kernel trick} can be adapted to be applicable. Some dimensionality reductions and variable fixing strategies are also developed for these models. An extensive battery of experiments has been run which reveal the powerfulness of our proposal as compared with other previously proposed methodologies.Comment: 8 Figures, 2 Table

Single item lot-sizing with non-decreasing capacities

We consider the single item lot-sizing problem with capacities that are non-decreasing over time. When the cost function is i) non-speculative or Wagner-Whitin (for instance, constant unit production costs and non-negative unit holding costs), and ii) the production set-up costs are non-increasing over time, it is known that the minimum cost lot-sizing problem is polynomially solvable using dynamic programming. When the capacities are non-decreasing, we derive a compact mixed integer programming reformulation whose linear programming relaxation solves the lot-sizing problem to optimality when the objective function satisfies i) and ii). The formulation is based on mixing set relaxations and reduces to the (known) convex hull of solutions when the capacities are constant over time. We illustrate the use and effectiveness of this improved LP formulation on a new test instances, including instances with and without Wagner-Whitin costs, and with both non-decreasing and arbitrary capacities over time.lot-sizing, mixing set relaxation, compact reformulation, production planning, mixed integer programming

Computer assisted modelling of linear, integer and separable programming problems

For mathematical programming (MP) to have greater impact upon the decision making process, MP software systems must offer suitable support in terms of model communication and modelling techniques . In this paper modelling techniques that allow logical restrictions to be modelled in integer programming terms are described and their implications discussed. In addition it is demonstrated that many classes of non-linearities which are not variable separable may be reformulated in piecewise linear form. It is shown that analysis of bounds is necessary in the following three important contexts: model reduction, formulation of logical restrictions as 0-1 mixed integer programs and reformulation of nonlinear programs as variable separable programs, It is observed that as well as incorporating an interface between the modeller and the optimiser there is a need to make available to the modeller software facilities which support the modelling techniques described here

Modelling a mixed system of air pollution fee and tradable permits for controlling nitrogen oxide: a case study of Taiwan

A mixed-integer non-linear programming model that minimises the total regulatory costs of controlling nitrogen oxide is used to investigate how a newly proposed permit trading scheme in Taiwan, which incorporates the features of banking and a nonone- to-one trading ratio, may affect firms’ emission reduction strategies and permit trading decisions. Compared to the previous regulation where only an air pollution fee is used, the new regulation that requires a reduction in emissions by 10 per cent from the emission level in the year 2000 for a 5 year period will increase the costs by 77 per cent, which is equivalent to US # 9.87 million. The design of banking and the increasing returns to scale characteristic of pollution control among firms might lead to an uneven reduction in emissions in each year. Setting a lower reservation rate for banking would, however, help maintain a more stable environmental quality without a significant loss to the government in terms of air pollution fee revenue.air pollution fee, banking, mixed-integer non-linear programming, nitrogen oxide, tradable permits, Resource /Energy Economics and Policy,

MIXED BUNDLING STRATEGIES AND MULTIPRODUCT PRICE COMPETITION

This paper deals with price competition among multiproduct firms. We consider a model with n firms and one representative buyer. Each firm produces a set of products that can be different or identical to the other firms' products. The buyer is characterized by her willingness to pay -in monetary terms- for every subset of products. To handle the combinatorial complexity of this general setting we use the linear relaxation of an integer programming package assignment problem. This approach allows to characterize all the equilibrium outcomes. We look for subgame perfect Nash equilibrium prices in mixed bundling strategies, i.e., when firms offer consumers the option of buying goods separately or else packages of them at a discount over the single good prices. We find that a mixed bundling subgame perfect Nash equilibrium price vector always exists. Also, the associated equilibrium outcome is always efficient, in the sense that it maximizes the social surplus. We extend the analysis to a model with m buyers and offer the conditions under which the equilibrium outcome set is non-empty.Multiproduct price competition, Integer Programming, Mixed Bundling Strategies, Subgame Perfect Nash Equilibria.