Focus on breakthroughs:

1 prediction module: grey prediction, time series prediction, neural network prediction, curve fitting (linear regression);

2 Classification discrimination: Euclidean distance discrimination, Fisher discrimination, etc.

3 Graph theory: the shortest path method;

4 optimization: the equations are solved by lindo or lingo software;

Other methods: analytic hierarchy process, Markov chain principal component analysis, etc.

6. The software used: MATLAB Lindo (Lingo) Excel;

Write some math papers before the competition.

This is the solution of Saiti and the winning works that participate in the competition every year. You can estimate for yourself. ...

Game problem solving method

Frequency Design Fitting and Planning of 93A Nonlinear Intermodulation

Graph Theory, Analytic Hierarchy Process and Integer Programming of 93B Football Team Ranking

Graph Theory, Interpolation and Dynamic Programming of 94A Mountain Open Circuit

Graph Theory and Combinatorial Mathematics of 94B Lock Packing Problem

Nonlinear programming and linear programming of flight management problems in 95A.

Dynamic planning, queuing theory and graph theory of job scheduling for 95B crown block and smelting furnace.

Differential equation and optimization of 96A optimal fishing strategy

Nonlinear Programming of 96B Water-saving Washing Machine

Nonlinear Programming of 97A Part Parameter Design

Stochastic simulation and graph theory of optimal arrangement of 97B truncated cutting

Multi-objective optimization and nonlinear programming for a class of portfolio problems in 98A.

Graph Theory and Combinatorial Optimization of the Best Route of 98B Disaster Relief Patrol

Stochastic Optimization and Computer Simulation of 99A Automatic Lathe Management

99B Drilling Layout 0- 1 Planning, Graph Theory

00A DNA sequence classification pattern recognition, Fisher discriminant, artificial neural network.

00B steel pipe ordering and transportation combination optimization, transportation problems

Curve fitting and surface reconstruction of 3 d reconstruction of 0 1A blood vessel

Multi-objective programming of 0 1B vehicle scheduling problem

Optimal nonlinear programming of line light source for 02A car lamp.

Single-objective Decision-making for the 22B Lottery Problem

Differential Equation and Difference Equation of 03A SARS Propagation

Overall Planning and Transportation of Production Vehicles in 3B Open-pit Mine

Statistical Analysis, Data Processing and Optimization of Temporary Supermarket Network Design for the 2004A Olympic Games

04B Power Market Transmission Congestion Management Data Fitting and Optimization

05A Yangtze River Water Quality Assessment and Prediction and Data Processing

Stochastic Programming and Integer Programming for Online Rental of 05B DVD

The design of the algorithm will directly affect the operation speed, so it is recommended to use mathematical software (

Mathematice, MATLAB, maple, mathcad, lindo, lingo, SAS, etc. ), here are ten kinds of mathematics.

Common algorithms for modeling, for reference only:

1, Monte Carlo algorithm (this algorithm is also called stochastic simulation algorithm, which is solved by computer simulation.

At the same time, we can test the correctness of our model through simulation, which is necessary in the competition.

The method used)

2, data fitting, parameter estimation, interpolation and other data processing algorithms (usually you will encounter many numbers in the game.

According to the needs of processing, and the key to processing data lies in these algorithms, usually using Matlab as a tool)

3, linear programming, integer programming, multivariate programming, quadratic programming and other planning problems (modeling competitions are mostly

Number theory problems belong to optimization problems, and many times these problems can be described by mathematical programming algorithms.

Usually implemented by Lindo and Lingo software)

4, graph theory algorithm (this kind of algorithm can be divided into many kinds, including the shortest path, network flow, bipartite graph and so on.

Methods, problems involving graph theory can be solved by these methods, which need careful preparation)

5. Computer algorithms such as dynamic programming, backtracking search, divide-and-conquer algorithm and branch-and-bound algorithm (these algorithms are all calculations

The methods commonly used in method design can be used in competitions on many occasions.

6. Three non-classical algorithms of optimization theory: simulated annealing method, neural network and genetic algorithm (these

The problem is an algorithm used to solve some difficult optimization problems, which is very helpful to some problems.

However, the algorithm is difficult to implement and needs to be used carefully. )

7, grid algorithm and exhaustive method (grid algorithm and exhaustive method are the biggest advantages of violent search algorithm, in very

There are applications in multiple competition questions, which can be used when the model itself is concerned and the algorithm is ignored.

Violent scheme, it is best to use some high-level languages as programming tools)

8, some continuous discretization methods (many problems are practical, data can be continuous, but planning.

Computers only recognize discrete data, so discretization is replaced by differentiation and summation.

Ideas such as integral are very important)

9, numerical analysis algorithm (if you use high-level language programming in the game, those numerical points?

The commonly used algorithms in analysis, such as solving equations, matrix operation, function integration, etc., all need extra editing.

Write a library function to call)

10, image processing algorithm (there is a kind of problem related to graphics in the competition, even if it has nothing to do with graphics, the paper

There should be many pictures in Chinese, so how to display these pictures and how to deal with them are the problems that need to be solved.

Problems, usually using Matlab to deal with)