Skip to main content
Elsevier
View Cart

Mathematical Programming

Theory and Methods

  • 1st Edition - January 1, 2005
  • Latest edition
  • Author: S. M. Sinha
  • Language: English

Mathematical Programming, a branch of Operations Research, is perhaps the most efficient technique in making optimal decisions. It has a very wide application in the analysis of… Read more

World Book Day celebration

Where learning shapes lives

Up to 25% off trusted resources that support research, study, and discovery.

Explore resources

Description

Mathematical Programming, a branch of Operations Research, is perhaps the most efficient technique in making optimal decisions. It has a very wide application in the analysis of management problems, in business and industry, in economic studies, in military problems and in many other fields of our present day activities. In this keen competetive world, the problems are getting more and more complicated ahnd efforts are being made to deal with these challenging problems. This book presents from the origin to the recent developments in mathematical programming.
The book has wide coverage and is self-contained. It is suitable both as a text and as a reference.

Key features

* A wide ranging all encompasing overview of mathematical programming from its origins to recent developments* A result of over thirty years of teaching experience in this feild* A self-contained guide suitable both as a text and as a reference

Readership

Mathematical programming, operations research and general Artificial Intelligence students

Table of contents

Introduction; MATHEMATICAL FOUNDATIONS; Basic Theory of Sets and Functions; Vector Spaces; Matrices and Determinants; Linear Transformations and Rank; Quadratic Forms and Eigenvalue Problems; Systems of Linear Equations and Linear Inequalities; Convex Sets and Convex Cones; Convex and Concave Functions; LINEAR PROGRAMMING; Linear Programming Problems; Simplex Method: Initial Basic Feasible Solution; Degeneracy in Linear Programming; The Revised Simplex Method; Duality in Linear Programming; Variants of the Simplex Method; Post-Optimization Problems: Sensitivity Analysis and Parametric Programming; Bounded Variable Problems; Transportation Problems; Assignment Problems; The Decomposition Principle for Linear Programs; Polynominal Time Algorithms for Linear Programming; NONLINEAR AND DYNAMIC PROGRAMMING; Nonlinear Programming; Quadratic Programming; Methods of Nonlinear Programming; Duality in Nonlinear Programming; Stochastic Programming; Some Special Topics in Mathematical Programming; Dynamic Programming; Bibliography; Index

Product details

  • Edition: 1
  • Latest edition
  • Published: February 12, 2006
  • Language: English

About the author

SS

S. M. Sinha

S. M. Sinha received his Ph.D. degree from the University of California at Berkeley in 1963. He then joined the University of Delhi and was responsible for introducing O.R. as a separate discipline in the university curriculum. This book is a result of his teaching experience in mathematical programming to graduate students of the University of Delhi for over 30 years.
Affiliations and expertise
Formerly Professor of Operational Research at the University of Delhi

View book on ScienceDirect

Read Mathematical Programming on ScienceDirect