Call Us 080-41656200 (Mon-Sat: 10AM-8PM)

Least-Squares Methods for Linear Programming Problems


Marketed By :  LAP LAMBERT Academic Publishing   Sold By :  Kamal Books International  
Delivery in :  10-12 Business Days


Check Your Delivery Options

Rs. 4,396

Availability: In stock

  • Product Description

Linear programming has evolved over the years, due tosustained research and testing,as an excellent mathematical tool for solving manytheoretical and practical problems.Yet, escalating problem sizes in practical problemspose serious challenges for the verybest linear programming codes, running on the fastestcomputing hardware. New linearprogramming solution techniques have to developed tomeet these challenges. Theresearch performed in this book intends to addressthis issue through a comprehensivestudy of least-squares methods for solving linearprogramming problems.We have developed two new linear programmingalgorithms based on least-squarestheory. A Combined Objectives Least-Squares (COLS)algorithm uses a Non-NegativeLeast-Squares (NNLS) algorithm framework for solvingboth the Phase I and Phase IIlinear programming problems. A Least-SquaresPrimal-Dual (LSPD) algorithm usesNNLS solutions by solving small NNLS problems tosolve relatively larger linear programmingproblems. These algorithms are impervious todegeneracy. Computationalresults for the algorithms shows a superiorperformance over the simplex algorithmon a wide range of linear programming problems.

Product Specifications
SKU :COC99325
AuthorBalaji Gopalakrishnan
Number of Pages124
Publishing Year2011-06-30T00:00:00.000
Edition1 st
Book TypeMathematics & science
Country of ManufactureIndia
Product BrandLAP LAMBERT Academic Publishing
Product Packaging InfoBox
In The Box1 Piece
Product First Available On ClickOnCare.com2015-08-18 00:00:00
0 Review(s)