Search Results - subject:"mixed integer programming."

Reducing the 0-1 knapsack problem with a single continuous variable to the standard 0-1 knapsack problem

Büther, Marcel; Briskorn, Dirk - 2007

The 0-1 knapsack problem with a single continuous variable (KPC) is a natural extension of the binary knapsack problem (KP), where the capacity is not any longer fixed but can be extended which is expressed by a continuous variable. This variable might be unbounded or restricted by a lower or...

Persistent link: https://www.econbiz.de/10011558835

Technology portfolio analysis for residential lighting

Balachandra, P.; Reddy, B. Sudhakara - Indira Gandhi Institute of Development Research (IGIDR) - 2007

mixed integer-programming model has been used for developing the optimal portfolio and a comparison of annual returns is …

Persistent link: https://www.econbiz.de/10005537297

Bounds for Maximin Latin Hypercube Designs

van Dam, Edwin Robert; Rennen, G.; Husslage, B.G.M. - Tilburg University, Center for Economic Research - 2007

the upper bounds, a vari- ety of combinatorial optimization techniques are employed. Mixed Integer Programming, the …

Persistent link: https://www.econbiz.de/10011091464

Coefficient strengthening : a tool for formulating mixed integer programs

ANDERSEN, Kent; POCHET, Yves - Center for Operations Research and Econometrics (CORE), … - 2007

Providing a good formulation is an important part of solving a mixed integer program. We suggest to measure the quality of a formulation by whether it is possible to strengthen the coefficients of the formulation. Sequentially strengthening coefficients can then be used as a tool for improving...

Persistent link: https://www.econbiz.de/10005043208

Single item lot-sizing with non-decreasing capacities

POCHET, Yves; WOLSEY, Laurence - Center for Operations Research and Econometrics (CORE), … - 2007

integer programming reformulation whose linear programming relaxation solves the lot-sizing problem to optimality when the …-sizing problem is polynomially solvable using dynamic programming. When the capacities are non-decreasing, we derive a compact mixed … polynomial time dynamic programming algorithm. The main goal in this paper is to develop a mixed integer programming formulation …

Persistent link: https://www.econbiz.de/10005043381

Technology portfolio analysis for residential lighting

Balachandra, P.; Reddy, B. Sudhakara - East Asian Bureau of Economic Research (EABER) - 2007

Maharashtra State in India. A mixed integer-programming model has been used for developing the optimal portfolio and a comparison …

Persistent link: https://www.econbiz.de/10009365559

Searching for Optimal Integer Solutions to Set Partitioning Problems Using Column Generation

Bredstrom, David; Jornsten, Kurt; Rönnqvist, M. - 2007

We describe a new approach to produce integer feasible columns to a set partitioning problem directly in solving the linear programming (LP) relaxation using column generation. Traditionally, column generation is aimed to solve the LP relaxation as quick as possible without any concern of the...

Persistent link: https://www.econbiz.de/10014048277

Lattice Based Extended Formulations for Integer Linear Equality Systems

Aardal, Karen; Wolsey, Laurence A. - 2007

We study different extended formulations for the set X = {x E Zn | Ax = Ax0} in order to tackle the feasibility problem for the set X+ = X N Zn+. Here the goal is not to find an improved polyhedral relaxation of conv(X+), but rather to reformulate in such a way that the new variables introduced...

Persistent link: https://www.econbiz.de/10014049597

Integer Programming and Constraint Programming in Solving a Multi-Machine Assignment Scheduling Problem With Deadlines and Release Dates

Sadykov, Ruslan; Wolsey, Laurence A. - 2007

, but approximate, Mixed Integer Programming formulation with a global constraint testing single machine feasibility. All …

Persistent link: https://www.econbiz.de/10014050340

Non-Linear Anonymous Pricing in Combinatorial Auctions

Drexl, Andreas; Jörnsten, Kurt O.; Knof, Diether - 2007

mixed-integer programming formulation of the pricing problem. The procedure is computationally tested using instances of the …

Persistent link: https://www.econbiz.de/10014052222