In the Branch-And-Bound Technique for Solving Integer Linear Programming Models $\le$

question 18

Multiple Choice

In the branch-and-bound technique for solving integer linear programming models with a maximization objective function:

• A)Once a feasible solution is found, it is optimal.
• B)If the solution generated at one stage is X₁ = 5.7, X₂ = 3 but gives an objective function value higher than that of the best integer solution found to date, X₂ must be either 0, 1, or 2 in the optimal solution.
• C)If the solution generated at one stage is X₁ = 5.7, X₂ = 3 but gives an objective function value higher than that of the best integer solution found to date, a new linear programming problem is solved with two constraints added: X₁\(\le\) 6 and X₁ \(\ge\)5.
• D)If the solution generated at one stage is X₁ = 5.7, X₂ = 3 but gives an objective function value higher than that of the best integer solution found to date, two new linear programs are solved, one with the constraint

---

Definitions:

Interneuron

A neuron variant that carries communication between sensory and motor neurons, essential for reflex actions and neural networks.

Motor Neuron

A neuron that conveys signals from the brain or spinal cord to muscles or glands, initiating movement or action.

Sensory Neuron

A type of neuron that transmits signals from sensory organs or receptors towards the central nervous system, enabling perception.

Motor Neuron

A type of neuron that transmits signals from the brain or spinal cord to muscles or glands, initiating movement or action.