Operations Research 2
Additional Exercises 1
1. i) Solve the following integer programming problem:
max z = x + 4y subject to
2x + 3y 11
x + 5y 13
4x + y 4,
where x and y are non-negative integers.
ii) What is the solution when only x is constrained to be
Operations Research 2
Additional Exercises 1
1. i) Solve the following integer programming problem:
max z = x + 4y subject to
2x + 3y 11
x + 5y 13
4x + y 4,
where x and y are non-negative integers.
ii) What is the solution when only x is constrained to be
Operations Research 2
Additional Exercises 1
1. i) Solve the following integer programming problem:
max z = x + 4y subject to
2x + 3y 11
x + 5y 13
4x + y 4,
where x and y are non-negative integers.
ii) What is the solution when only x is constrained to be
Ecole
Polytechnique
Problems and exercises in Operations Research
Leo Liberti1
Last update: November 20, 2010
1 Some exercises have been proposed by other authors, as detailed in the text. All the solutions, however, are by the
author, who takes full res
Ecole
Polytechnique
Problems and exercises in Operations Research
Leo Liberti1
Last update: November 20, 2010
1 Some exercises have been proposed by other authors, as detailed in the text. All the solutions, however, are by the
author, who takes full res