# Question

Reconsider the nonconvex programming problem shown in Prob. 14.3-7. Suppose now that the variable x is restricted to be an integer.

(a) Perform the initialization step and the first iteration of the basic genetic algorithm presented in Sec. 14.4 by hand. Follow the instructions given at the beginning of the Problems section to obtain the needed random numbers. Show your work, including the use of the random numbers.

(a) Perform the initialization step and the first iteration of the basic genetic algorithm presented in Sec. 14.4 by hand. Follow the instructions given at the beginning of the Problems section to obtain the needed random numbers. Show your work, including the use of the random numbers.

## Answer to relevant Questions

Reconsider the example of a traveling salesman problem shown in Fig. 14.4. (a) When the sub-tour reversal algorithm was applied to this problem in Sec. 14.1, the first iteration resulted in a tie for which of two sub-tour ...Reconsider the example of an unconstrained minimum spanning tree problem given in Sec. 10.4. Suppose that the following constraints are added to the problem: Constraint 1: Either link AD or link ET must be ...For the game having the following payoff table, determine the optimal strategy for each player by successively eliminating dominated strategies. (Indicate the order in which you eliminated strategies.) The A. J. Swim Team soon will have an important swim meet with the G. N. Swim Team. Each team has a star swimmer (John and Mark, respectively) who can swim very well in the 100- yard butterfly, backstroke, and breaststroke ...Consider variation 3 of the political campaign problem (see table 15.6). refer to the resulting linear programming model for player 1 given near the end of sec. 15.5. ignoring the objective function variable x3, plot the ...Post your question

0