Reference no: EM131100314
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 (α) 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.)
Prob. 12.4-5
Consider the following discrete nonlinear programming problem
The numbers along the links represent distances, and the objective is to find the shortest path from the origin to the destination. This problem also can be formulated as a BIP model involving both mutually exclusive alternatives and contingent decisions.
(a) Formulate this model. Identify the constraints that are for mutually exclusive alternatives and that are for contingent decisions.
(b) Use the computer to solve this problem
|
The following constraints of pure bip problems
: For each of the following constraints of pure BIP problems, identify which ones are made redundant by the binary constraints. Explain why each one is, or is not, redundant.
|
|
Communication protocols and devices
: Can you help me prepare a presentation that examines and depicts a cluster connected over a LAN and provide the communication protocols and devices at each level of the OSI model are discussed and depicted in a diagram in the presentation.
|
|
The same pure bip problem to fix
: Use the following set of constraints for the same pure BIP problem to fix as many variables as possible. Also identify the constraints which become redundant because of the fixed variables.
|
|
Support and troubleshooting checklist
: Develop a support and troubleshooting checklist based on the five operating systems issues. Include:
|
|
The tightest possible nonlinear programming
: (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.
|
|
Maximal depth of decision tree derived
: (1) How many scans of the database does your algorithm take if the maximal depth of decision tree derived is 5? (2) What is the maximum memory space your algorithm will use in your tree induction?
|
|
Formulate an ip model for this problem
: A machine shop makes two products. Each unit of the first product requires 3 hours on machine 1 and 2 hours on machine 2. Each unit of the second product requires 2 hours on machine 1 and 3 hours on machine 2. Machine 1 is available only 8 hours p..
|
|
Find the percentage error over the band
: find the percentage error over the band in making this approximation.
|
|
Write paper on should america go to second world war or not
: Write a paper about should america go to Second World War or not. Have a clear thesis statement You are making an argument Plan your essay Integrate your quotes six pages double space, with Chicago Style.
|