Volltext
Dr. Maximilian Merkert Benjamin Peters M.Sc.
Winter term 2019/2020
www.math.uni-magdeburg.de/institute/imo/teaching/wise19/cao/
January 31, 2020
Solve the following integer program using the branch and bound method. For the linear subproblems you can use and modify the template from the lecture website.
max 100x1+150x2
s.t. 8000x1+4000x2 ≤40000 15x1+30x2 ≤200
x1, x2 ≥0
x1, x2 ∈Z
p. 1/1
ÄHNLICHE DOKUMENTE
The company Color Ink spray-paints wooden toys for children in 7 different colors, namely: white, yellow, red, green, blue, purple and black.. The spray-painting is done by one
Following the transportation policy of the last years, the Best Bread company has already assigned small trucks (maximum capacity: 200 breads) and large trucks (max- imum capacity:
[r]
[r]
(d) The assignment problem is extended by the facts that employees can work on dif- ferent projects for certain amounts of their total working hours, projects require certain amounts
(a) Interpret this problem as a maximum weighted perfect matching problem and give an general mathematical formulation. (b) Model and solve this problem by
(a) Formulate a mathematical program in AMPL, which is able to answer the question of the shop floor manager for the maximum number of simultaneously executable tasks.. Solve
The following table describes the required working time in each of the three work steps Cutting, Painting and Wrapping for cups and plates.. The working time and the amount of
