Question: Reconsider the discrete nonlinear programming problem given in Prob. 12.4-5. (a) Use the following outline in designing the main features of a branch-and-bound algorithm for

Reconsider the discrete nonlinear programming problem given in Prob. 12.4-5.

(a) Use the following outline in designing the main features of a branch-and-bound algorithm for solving this problem (and similar problems) directly without reformulation.

(i) Specify the tightest possible nonlinear programming relaxation that has only continuous variables and so can be solved efficiently by nonlinear programming techniques.

(The next chapter will describe how such nonlinear programming problems can be solved efficiently.)

(ii) Specify the fathoming tests.
(iii) Specify a branching procedure that involves specifying two ranges of values for a single variable.

(b) Use the algorithm designed in part

(a) to solve this problem by using an available software package to solve the quadratic programming relaxation at each iteration. (As described in Sec.
13.7, Excel, LINDO, LINGO, and MPL/CPLEX all are able to solve quadratic programming problems.)

Step by Step Solution

3.40 Rating (150 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Introduction To Operations Research Questions!