# subject- operations research, chapters- non linear optimization, ch-2 network optimization( Minimum cost and shortest path problems) in excel solving overall 2 problems

subject- operations research, chapters- non linear optimization, ch-2 network optimization( Minimum cost and shortest path problems) in excel solving overall 2 problems

subject- operations research, chapters- non linear optimization, ch-2 network optimization( Minimum cost and shortest path problems) in excel solving overall 2 problems
What is one of the advantages of using nonlinear programming? Which of the followings are examples of a nonlinear function? a. P= 5 X + 7 X2 – 2 X2. b. P= 8 X1 – 4 X2. c. P= X1 + 6 X2 + 3 X1*X2. d. All of the above A separable programming problem is actually a two or more linear programming problems. (T / F) A separable programming problem has more than one decision variable (T / F) A nonlinear programming problem may have only two local maxima (T / F) Problems with increasing marginal returns are generally easier for Solver to solve than problems with decreasing marginal returns. (T / F) Using the below function, please answer these questions: Number of local minimum(s) Number of global minimum(s) Bonus: (2 points each) The Evolutionary Solver requires that the constraints all be linear. ( T / F ) We can approximate a nonlinear programming problem by a linear one. ( T / F ) If the slope of a curve on a profit graph never increases but sometimes decreases as the level of the activity increases, then it is said to have increasing marginal returns. ( T / F ) A nonlinear programming problem will have how many local maxima? 0 1 2 3 It can have any number of local maxima.