Urban entertainment all-rounder
Chapter 656 Make a Sensation
Chapter 656 Make a Sensation
They all hated the Invincible Legion very much.
Liu Shiyuan naturally doesn't care about these things, he is now studying whether he should use Nai An's identity to do something.
"What kind of topic is suitable?"
At this time he remembered a story
There was a young man studying advanced mathematics in college.
He was so afraid that he would fail the exam that he stayed up the night before the exam to study and overslept.
He rushed to the classroom in a hurry and had already started the exam.
There are three equations written on the blackboard.The first two are easy, the third is super hard!The young man gritted his teeth and struggled to solve the problems, finally found an effective method, and completed the three problems before handing in the paper.
In the evening he received a call from the professor.
The professor shouted at him: "Do you know what you wrote!" He thought: It's over, the answer must be wrong.As a result, the professor continued: "The first two questions are the exam questions! The third question is a difficult problem that no one has been able to solve since Einstein, and you finally solved it!"
In some versions, the young man is Chinese.In some versions, it took the youth all night to solve the problem.
In another version, the young man went to a company after graduation, and his boss arranged some difficult jobs for him. A few days later, he handed over the work he finished with his teeth to the boss, and the boss was shocked: This is your half-year workload!
However, although this story sounds very successful, much like an urban legend, it has a real prototype.
The real story happened to the American mathematician George Bernard Danziger, and there are only some differences in details from the above story.
Danziger is known as the father of linear programming.
He received his Ph.D. from the University of California, Berkeley in 1946.This anecdote happened in 1939.He later recalled the incident in an interview:
It was his first year at Berkeley.
One day he went to a class with Professor Neiman and was late.
He saw two statistics problems on the blackboard, thought it was homework, and copied it back.
These two questions are not exactly "unsolved problems", but unproven statistical theorems.
A few days later he finished it, went to hand in the assignment, and apologized to Professor Neiman that the assignment took a little longer because the questions seemed a little harder than usual.
He asked the professor if he was still in a hurry to hand in his homework?The professor said, then throw it on my desk.There were all kinds of paper piled up on the professor's desk, and Danziger was still thinking that he would never find it again after throwing it away.
As a result, six weeks later, on a Sunday morning, the professor came to Dan Ziger and said: I have written the introduction for the first problem you solved, please take a look, and then I will submit it for publication!Danzig is completely out of shape...
A year later, it was time for Danziger to choose a topic. He didn't know how to choose, so he went to Professor Neiman.The professor shrugged and said, you go and print out those two questions and bind them to me, that's your subject.
The second problem he tackled was not published anytime soon.Until about 1950, another Romanian mathematician, Abraham Wald, also solved that problem independently, submitting a paper to the journal.
It was pointed out to him that Danziger's conclusions were exactly the same as his.So he contacted Danzig, listing him as a co-author for the publication.
This incident spread later because Danziger once met a pastor (Robert Schuler) who advocated "positive thinking". After hearing Danziger's story, Schuller asked if he could write this story. into his upcoming book.
It turned out that when he wrote it, he changed the story and made it more exaggerated.
For example, he changed his homework into an exam, and Danzig solved the last question "10 minutes before handing in the paper"; he also added descriptions such as "unsolved mysteries that Einstein could not solve", etc. wait.
Schuler adds this moral to the story: If Danziger had known from the start that these two problems were not homework but famous statistics unsolved puzzles, he might not have "positive thinking" and might have been discouraged. I will never be able to solve these two problems.
Danziger is a member of the National Academy of Sciences, the National Academy of Engineering, and the American Academy of Arts and Sciences.
He has won the Von Neumann Theory Award and the National Science Award, and he even named an award after himself.He proposed the simplex method.He has made major contributions to statistics, operations research, computer science, and economics.
Linear programming is an important branch of operations research with earlier research, faster development, wider application and more mature methods. It is a mathematical method to assist people in scientific management.The mathematical theory and method of studying the extremum problem of the linear objective function under the linear constraint condition, English abbreviation LP.
It is an important branch of operations research, widely used in military operations, economic analysis, management and engineering technology.
To provide a scientific basis for the optimal decision-making made by rationally using limited manpower, material resources, financial resources and other resources
French mathematicians *****- J. Fourier and C. Valle-Poussin independently proposed the idea of linear programming in 1832 and 1911, but did not attract attention.
In 1939, the Soviet mathematician L.V. Kantorovich proposed a linear programming problem in his book "Mathematical Methods in Production Organization and Planning", but it did not attract attention.
In 1947, the American mathematician GB Dantzing proposed the simplex method for solving linear programming, which laid the foundation for this subject.
In 1947, the American mathematician J. von Neumann proposed the duality theory, which created many new research fields of linear programming and expanded its application scope and problem-solving ability.
In 1951, the American economist TC Koopmans applied linear programming to the economic field, for which he won the 1975 Nobel Prize in Economics together with Kantorovich.
After the 50s, a lot of theoretical research on linear programming was carried out, and a large number of new algorithms emerged.For example, in 1954, C. Lemkey proposed the dual simplex method. In 1954, S. Gass and T. Sadie and others solved the sensitivity analysis and parameter programming problems of linear programming. In 1956, A. Tucker proposed the complementary relaxation theorem , In 1960, GB Danzig and P. Wolf proposed decomposition algorithm and so on.
The research results of linear programming also directly promote the algorithm research of other mathematical programming problems including integer programming, stochastic programming and nonlinear programming.Due to the development of digital electronic computers, there have been many linear programming software, such as MPSX, OPHEIE, UMPIRE, etc., which can easily solve linear programming problems with thousands of variables.
In 1979, the Soviet mathematician LG Khachian proposed the ellipsoid algorithm for solving linear programming problems, and proved that it is a polynomial time algorithm.
In 1984, N. Kamaka, an Indian mathematician at Bell Telephone Laboratories in the United States, proposed a new polynomial time algorithm for solving linear programming problems.Using this method to solve linear programming problems requires only 5000/1 of the time required by the simplex method when the number of variables is 50.The theory of linear programming polynomial algorithm has been formed.
After the 50s, the scope of application of linear programming continued to expand.
The above are all things that appeared in Liu Shiyuan's mind.
He checked in this life, but this problem has not been resolved, and even the person who proposed this theory has not received any attention.
"My husband is going crazy, saying that you are against Alice. We all know that you are talented, but a talented person should not be like you. You are easily misunderstood. Now many people say you are crazy. Aotian. Even the guy from the Invincible Legion said that about you.
Husband, you are not the same as before, you should be more modest, okay? "Cui Wenxu said with some worry.
Liu Shiyuan looked at the anxious Cui Wenxu in front of him and said with a smile: "Don't worry, everything will be resolved, and don't care what others say. I just said that it is wrong for them to be others? Isn't it good?"
(End of this chapter)
They all hated the Invincible Legion very much.
Liu Shiyuan naturally doesn't care about these things, he is now studying whether he should use Nai An's identity to do something.
"What kind of topic is suitable?"
At this time he remembered a story
There was a young man studying advanced mathematics in college.
He was so afraid that he would fail the exam that he stayed up the night before the exam to study and overslept.
He rushed to the classroom in a hurry and had already started the exam.
There are three equations written on the blackboard.The first two are easy, the third is super hard!The young man gritted his teeth and struggled to solve the problems, finally found an effective method, and completed the three problems before handing in the paper.
In the evening he received a call from the professor.
The professor shouted at him: "Do you know what you wrote!" He thought: It's over, the answer must be wrong.As a result, the professor continued: "The first two questions are the exam questions! The third question is a difficult problem that no one has been able to solve since Einstein, and you finally solved it!"
In some versions, the young man is Chinese.In some versions, it took the youth all night to solve the problem.
In another version, the young man went to a company after graduation, and his boss arranged some difficult jobs for him. A few days later, he handed over the work he finished with his teeth to the boss, and the boss was shocked: This is your half-year workload!
However, although this story sounds very successful, much like an urban legend, it has a real prototype.
The real story happened to the American mathematician George Bernard Danziger, and there are only some differences in details from the above story.
Danziger is known as the father of linear programming.
He received his Ph.D. from the University of California, Berkeley in 1946.This anecdote happened in 1939.He later recalled the incident in an interview:
It was his first year at Berkeley.
One day he went to a class with Professor Neiman and was late.
He saw two statistics problems on the blackboard, thought it was homework, and copied it back.
These two questions are not exactly "unsolved problems", but unproven statistical theorems.
A few days later he finished it, went to hand in the assignment, and apologized to Professor Neiman that the assignment took a little longer because the questions seemed a little harder than usual.
He asked the professor if he was still in a hurry to hand in his homework?The professor said, then throw it on my desk.There were all kinds of paper piled up on the professor's desk, and Danziger was still thinking that he would never find it again after throwing it away.
As a result, six weeks later, on a Sunday morning, the professor came to Dan Ziger and said: I have written the introduction for the first problem you solved, please take a look, and then I will submit it for publication!Danzig is completely out of shape...
A year later, it was time for Danziger to choose a topic. He didn't know how to choose, so he went to Professor Neiman.The professor shrugged and said, you go and print out those two questions and bind them to me, that's your subject.
The second problem he tackled was not published anytime soon.Until about 1950, another Romanian mathematician, Abraham Wald, also solved that problem independently, submitting a paper to the journal.
It was pointed out to him that Danziger's conclusions were exactly the same as his.So he contacted Danzig, listing him as a co-author for the publication.
This incident spread later because Danziger once met a pastor (Robert Schuler) who advocated "positive thinking". After hearing Danziger's story, Schuller asked if he could write this story. into his upcoming book.
It turned out that when he wrote it, he changed the story and made it more exaggerated.
For example, he changed his homework into an exam, and Danzig solved the last question "10 minutes before handing in the paper"; he also added descriptions such as "unsolved mysteries that Einstein could not solve", etc. wait.
Schuler adds this moral to the story: If Danziger had known from the start that these two problems were not homework but famous statistics unsolved puzzles, he might not have "positive thinking" and might have been discouraged. I will never be able to solve these two problems.
Danziger is a member of the National Academy of Sciences, the National Academy of Engineering, and the American Academy of Arts and Sciences.
He has won the Von Neumann Theory Award and the National Science Award, and he even named an award after himself.He proposed the simplex method.He has made major contributions to statistics, operations research, computer science, and economics.
Linear programming is an important branch of operations research with earlier research, faster development, wider application and more mature methods. It is a mathematical method to assist people in scientific management.The mathematical theory and method of studying the extremum problem of the linear objective function under the linear constraint condition, English abbreviation LP.
It is an important branch of operations research, widely used in military operations, economic analysis, management and engineering technology.
To provide a scientific basis for the optimal decision-making made by rationally using limited manpower, material resources, financial resources and other resources
French mathematicians *****- J. Fourier and C. Valle-Poussin independently proposed the idea of linear programming in 1832 and 1911, but did not attract attention.
In 1939, the Soviet mathematician L.V. Kantorovich proposed a linear programming problem in his book "Mathematical Methods in Production Organization and Planning", but it did not attract attention.
In 1947, the American mathematician GB Dantzing proposed the simplex method for solving linear programming, which laid the foundation for this subject.
In 1947, the American mathematician J. von Neumann proposed the duality theory, which created many new research fields of linear programming and expanded its application scope and problem-solving ability.
In 1951, the American economist TC Koopmans applied linear programming to the economic field, for which he won the 1975 Nobel Prize in Economics together with Kantorovich.
After the 50s, a lot of theoretical research on linear programming was carried out, and a large number of new algorithms emerged.For example, in 1954, C. Lemkey proposed the dual simplex method. In 1954, S. Gass and T. Sadie and others solved the sensitivity analysis and parameter programming problems of linear programming. In 1956, A. Tucker proposed the complementary relaxation theorem , In 1960, GB Danzig and P. Wolf proposed decomposition algorithm and so on.
The research results of linear programming also directly promote the algorithm research of other mathematical programming problems including integer programming, stochastic programming and nonlinear programming.Due to the development of digital electronic computers, there have been many linear programming software, such as MPSX, OPHEIE, UMPIRE, etc., which can easily solve linear programming problems with thousands of variables.
In 1979, the Soviet mathematician LG Khachian proposed the ellipsoid algorithm for solving linear programming problems, and proved that it is a polynomial time algorithm.
In 1984, N. Kamaka, an Indian mathematician at Bell Telephone Laboratories in the United States, proposed a new polynomial time algorithm for solving linear programming problems.Using this method to solve linear programming problems requires only 5000/1 of the time required by the simplex method when the number of variables is 50.The theory of linear programming polynomial algorithm has been formed.
After the 50s, the scope of application of linear programming continued to expand.
The above are all things that appeared in Liu Shiyuan's mind.
He checked in this life, but this problem has not been resolved, and even the person who proposed this theory has not received any attention.
"My husband is going crazy, saying that you are against Alice. We all know that you are talented, but a talented person should not be like you. You are easily misunderstood. Now many people say you are crazy. Aotian. Even the guy from the Invincible Legion said that about you.
Husband, you are not the same as before, you should be more modest, okay? "Cui Wenxu said with some worry.
Liu Shiyuan looked at the anxious Cui Wenxu in front of him and said with a smile: "Don't worry, everything will be resolved, and don't care what others say. I just said that it is wrong for them to be others? Isn't it good?"
(End of this chapter)
You'll Also Like
-
Late Ming Dynasty: So what if Emperor Chongzhen was inactive?!
Chapter 62 4 hours ago -
Blue Card Starry Sky
Chapter 220 4 hours ago -
Electronic Nezha
Chapter 32 4 hours ago -
Oh no! They all seem a bit off!
Chapter 220 4 hours ago -
Daily Spy Life in the Detective Conan World
Chapter 890 4 hours ago -
Reborn Cat Sheriff
Chapter 693 4 hours ago -
Fire Virtue Immortal Clan
Chapter 561 1 days ago -
LOL: My talent is top-tier, my professional skills are unparalleled.
Chapter 682 1 days ago -
Courtyard House: Starting in a Ceramics Factory
Chapter 589 1 days ago -
Hong Kong variety show: I Am a Tycoon
Chapter 666 1 days ago