AppliedMathematicalProgramming - Mathematical Programming:...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Mathematical Programming: An Overview 1 Management science is characterized by a scientific approach to managerial decision making. It attempts to apply mathematical methods and the capabilities of modern computers to the difficult and unstructured problems confronting modern managers. It is a young and novel discipline. Although its roots can be traced back to problems posed by early civilizations, it was not until World War II that it became identified as a respectable and well defined body of knowledge. Since then, it has grown at an impressive pace, unprecedented for most scientific accomplishments; it is changing our attitudes toward decision-making, and infiltrating every conceivable area of application, covering a wide variety of business, industrial, military, and public-sector problems. Management science has been known by a variety of other names. In the United States, operations research has served as a synonym and it is used widely today, while in Britain operational research seems to be the more accepted name. Some people tend to identify the scientific approach to managerial problem-solving under such other names as systems analysis, cost–benefit analysis, and cost-effectiveness analysis. We will adhere to management science throughout this book. Mathematical programming, and especially linear programming, is one of the best developed and most used branches of management science. It concerns the optimum allocation of limited resources among competing activities, under a set of constraints imposed by the nature of the problem being studied. These constraints could reflect financial, technological, marketing, organizational, or many other considerations. In broad terms, mathematical programming can be defined as a mathematical representation aimed at program-ming or planning the best possible allocation of scarce resources. When the mathematical representation uses linear functions exclusively, we have a linear-programming model. In 1947, George B. Dantzig, then part of a research group of the U.S. Air Force known as Project SCOOP (Scientific Computation Of Optimum Programs), developed the simplex method for solving the general linear-programming problem. The extraordinary computational efficiency and robustness of the simplex method, together with the availability of high-speed digital computers, have made linear programming the most powerful optimization method ever designed and the most widely applied in the business environment. Since then, many additional techniques have been developed, which relax the assumptions of the linear-programming model and broaden the applications of the mathematical-programming approach. It is this spectrum of techniques and their effective implementation in practice that are considered in this book....
View Full Document

This note was uploaded on 12/19/2009 for the course INDUSTRIAL ie500 taught by Professor Mathematicalprogrammibg during the Spring '09 term at Bilkent University.

Page1 / 539

AppliedMathematicalProgramming - Mathematical Programming:...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online