COVID-19 Update: We are currently shipping orders daily. However, due to transit disruptions in some geographies, deliveries may be delayed. To provide all customers with timely access to content, we are offering 50% off Science and Technology Print & eBook bundle options. Terms & conditions.
Mathematical Programming - 1st Edition - ISBN: 9788131203767, 9780080535937

Mathematical Programming

1st Edition

Theory and Methods

0.0 star rating Write a review
Author: S. M. Sinha
eBook ISBN: 9780080535937
Imprint: Elsevier Science
Published Date: 1st January 2005
Page Count: 572
Sales tax will be calculated at check-out Price includes VAT/GST
Price includes VAT/GST

Institutional Subscription

Secure Checkout

Personal information is secured with SSL technology.

Free Shipping

Free global shipping
No minimum order.


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


Mathematical programming 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


No. of pages:
© Elsevier Science 2006
1st January 2005
Elsevier Science
eBook ISBN:

About the Author

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

Ratings and Reviews