Browsing by Subject "valid inequalities"
Now showing 1 - 2 of 2
- Results Per Page
- Sort Options
Item Open Access Valid inequalities for the problem of optimizing a nonseparable piecewise linear function on 0-1 variables(2011) Aksüt, Ziyaattin HüsrevIn many procurement and transportation applications, the unit prices depend on the amount purchased or transported. This results in piecewise linear cost functions. Our aim is to study the structure that arises due to a piecewise linear objective function and to propose valid inequalities that can be used to solve large procurement and transportation problems. We consider the problem of optimizing a nonseparable piecewise linear function on 0-1 variables. We linearize this problem using a multiple-choice model and investigate properties of facet defining inequalities. We propose valid inequalities and lifting results.Item Open Access Vendor location problem(2009) Çınar, YüceIn this study, we aim to design a distribution system with the following components: the location of vendors, the number of vendors, the service region of the vendors, the number of vehicles and workers, and the assignment of demand points to these vendors and vehicles. We define our problem as a two-level capacitated discrete facility location problem with minimum profit constraints and call it Vendor Location Problem. In order to formulate the problem, two different objective functions are used: vendors’s profit maximization and maximization of the demand covered. Integer linear programs for these two versions of the problem are formulated. Valid inequalities are used to strengthen the upper bounds. Finally, the performance of these models with different parameters are compared in terms of linear programming relaxation gap, optimality gap, CPU time, and the number of opened nodes for four different types of instances: instances with demand and profit which are independent of distance; profit function of distance; demand function of distance; demand and profit function of distance.