The three schools are located in sectors B, C, and E. He also recognizes that if a student happens to live in a certain sector and is assigned to the high school in that sector, there is no need to bus him because he can walk to school. The superintendent partitions the county into five geographic sectors as he attempts to establish a plan that will minimize the total number of student miles traveled by bus. He recognizes the need to bus a certain number of students, because several sectors, A-E, of the county are beyond walking distance to a school. Show transcribed image text SOLVE USING EXCEL! 8.16 The Hills County, Michigan, superintendent of education is responsible for assigning students to the three high schools in his county. With the GRG Nonlinear and Evolutionary Solving methods, you should expect a вЂњgood,вЂќ but not provably optimal solution.PLEASE make sure to solve using excel solver and show all With the Simplex LP Solving method, you can find a globally optimal solution given enough time вЂ“ but you may have to settle for a solution thatвЂ™s вЂњclose to optimalвЂќ found in a more reasonable amount of time. However, these constraints make the problem non-convex and much harder to solve. You can use integer, binary, and alldifferent constraints on variables with all three Solving methods.The Evolutionary Solving method is designed for these problems. If your objective and constraints are non-smooth and non-convex functions of the decision variables (for example if you use IF, CHOOSE and LOOKUP functions whose arguments depend on decision variables), the best you can hope for is a вЂњgoodвЂќ solution (better than the initial values of the variables), not a locally or globally optimal solution.The GRG Nonlinear Solving method is designed for these problems. If the problem is convex, you can be confident of finding a globally optimal solution, but if it is non-convex, you can only expect a locally optimal solution вЂ“ and even this may be hard to find. If your objective and constraints are smooth nonlinear functions of the decision variables, solution times will be longer.The Simplex LP Solving method is designed for these problems. This is a linear programming problem it is also a convex optimization problem (since all linear functions are convex). If your objective and constraints are linear functions of the decision variables, you can be confident of finding a globally optimal solution reasonably quickly, given the size of your model.The mathematical relationships, which are determined by the formulas in your model, may be harder to assess, but they often have a decisive impact on solution time and quality вЂ“ as further explained starting with this topic. Your modelвЂ™s total size and the use of integer constraints are both relatively easy to assess when you examine your model. Although faster algorithms and faster processors can help, some non-convex or non-smooth models could take years or decades to solve to optimality on the fastest imaginable computers. Other issues, such as poor scaling, can also affect solution time and quality, but the above characteristics affect the intrinsic solvability of your model. The use of integer constraints on variables in your model.linear or nonlinear) between the objective and constraints and the decision variables Your model size (number of decision variables and constraints, total number of formulas).The kind of solution you can expect, and how much computing time may be needed to find a solution, depends primarily on three characteristics of your model: SolverвЂ™s basic purpose is to find a solution вЂ“ that is, values for the decision variables in your model вЂ“ that satisfies all of the constraints and maximizes or minimizes the objective cell value (if there is one).

Solver for excel 08