Scribd
Upload
86 views

Self Assessment Integer Programmming

1. Integer programming problems involve decision variables that must take on integer values. Solving integer programs exactly can be more difficult than solving linear programs. 2. Branch and bound is a common technique for solving integer programs to optimality. It works by branching on integer variables and bounding the solution at each branch. 3. Rounding the solution to a linear relaxation of an integer program may provide a feasible solution, but it is not guaranteed to be feasible or optimal.

Uploaded by

Diễm Phan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
86 views

Self Assessment Integer Programmming

1. Integer programming problems involve decision variables that must take on integer values. Solving integer programs exactly can be more difficult than solving linear programs. 2. Branch and bound is a common technique for solving integer programs to optimality. It works by branching on integer variables and bounding the solution at each branch. 3. Rounding the solution to a linear relaxation of an integer program may provide a feasible solution, but it is not guaranteed to be feasible or optimal.

Uploaded by

Diễm Phan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 7

Self-assessment- integer programming _IU

Self assessment – Integer Programmming


True False
4. 2020

Which of the following statements is true?

a. Suppose X1 and X2 are both binary variables where Xi = 1 if a plant is


built at location i. The constraint "a plant can be built at location 2
only if the plant at location 1 is also built" is represented by X 1 ≤ X2.

Correct:
b. Rounding does not necessarily provide feasible solutions and feasible
solutions from rounding are not necessarily optimal.
c. In general, it is no more difficult to solve an IP than an LP.
d. An IP solution can be better than the LP solution to the same
problem.

Which of the following statements is true?


a. Rounding an optimal solution to the nearest integers will provide
a feasible solution.
b. In a pure IP problem all decision variables must be either 0 or 1 in the
optimal solution.
c. In a mixed IP problem only some of the decision variables are
restricted to integer amounts.
d. In the Branch-and-Bound method, stop branching when the objective
function value for a branch is greater than or equal to the best integer-
valued solution found so far.

1
Self-assessment- integer programming _IU

Suppose Xi (i = 1, 2) is 1 if department i is expanded and 0


if department i is not expanded. What constraint is needed
to ensure that if one department is expanded then both will
be expanded?
a. X1−X2≥0
b. X1 − X2 ≤ 0
c. X1+X2≤2
d. X1−X2=0

Suppose Xi (i = 1, 2) is 1 if project i is selected and 0 if project i


is not selected. To ensure that project 1 cannot be selected
unless project 2 is also selected, one would include which of the
following constraints? ( if p2 can not be selected, p1 cannot be
selected )
a. X1+X2≤1
b. X1−X2=1
c. X1+X2=1
d. X1−X2≤0

2
Self-assessment- integer programming _IU

In a Branch-and-Bound problem, if X1 = 5 and X2 = 3.7, then


which of the following would be a possible branching option?
a. X2≥3
b. X2≥4
c. X1≤5
d. X2≤4

Let P1 equal the number of units of Product 1 to produce.


Assume that either P1 = 0 or L ≤ P1 ≤ U. If Y is a binary
variable, then which of the following constraints model
the above condition?
a. P1 + LY ≤ 0 and P1 − UY ≥ 0
b. P1 − UY ≤ 0 and P1 − LY ≥ 0
c. P1 − UY ≥ 0 and P1 − LY ≤ 0
d. P1 + UY ≤ 0 and P1 − LY ≥ 0

A fixed-charge problem would be an example of a:


a. pure IP problem.
b. mixed binary IP problem.
c. mixed IP problem.
d. pure binary IP problem.

3
Self-assessment- integer programming _IU

For Company Z, the amount shipped to three out of four


destinations must not exceed 45 tons. This is an example of
what kind of constraint?
a. Non-consecutive values requirement
b. Minimum batch requirement
c. k out of n constraint
d. Big-M method

A decision-maker wishes to choose at least two projects out of a


total of five. The appropriate constraint is:

a. X1+X2+X3+X4+X5>2
b. X1+X2+X3+X4+X5=2
c. X1+X2+X3+X4+X5≥2
d. X1+X2+X3+X4+X5≤2

4
Self-assessment- integer programming _IU

Which of the following statements is true?


a. The relaxed problem has fewer( c: same) variables
than the corresponding problem with the integer
constraints.
b. Integer requirements need to be specified as additional
constraints in Solver.
c. Sunk (C: FIXED NOT SUNK) costs are usually
considered in fixed-charge models.
d. The Branch-and-Bound method will provide
good solutions as opposed to optimal solutions.

Binary variables also called zero-one variables so they are:


a. variables that can take on any number between 0 and 1 and
not include 0 or 1.
b. variables that can take on only either 0 or 1.
c. variables that can take on any number between 0 and 1 inclusive.

If the solution to the problem requires all the optimal values to


be integers then rounding off the optimal solution to the non-
integer problem is
a. always feasible but not optimal
b. always a feasible point

5
Self-assessment- integer programming _IU

c. may be either a feasible point or infeasible point


d. always a feasible point and the optimal point

You might also like