A theoretical comparison between the simplex method and the basic line search algorithm. (2nd January 2016)
- Record Type:
- Journal Article
- Title:
- A theoretical comparison between the simplex method and the basic line search algorithm. (2nd January 2016)
- Main Title:
- A theoretical comparison between the simplex method and the basic line search algorithm
- Authors:
- Dumaldar, Mahesh N.
- Abstract:
- Abstract : A theoretical comparison between the simplex method (SM) and the basic line search method (BLSA) is presented. The explicit formulae for the upper and lower bounds in the BLSA are provided using SM. Further, it is shown that both methods are operationally equivalent.
- Is Part Of:
- Optimization. Volume 65:Number 1(2016)
- Journal:
- Optimization
- Issue:
- Volume 65:Number 1(2016)
- Issue Display:
- Volume 65, Issue 1 (2016)
- Year:
- 2016
- Volume:
- 65
- Issue:
- 1
- Issue Sort Value:
- 2016-0065-0001-0000
- Page Start:
- 1
- Page End:
- 7
- Publication Date:
- 2016-01-02
- Subjects:
- linear programming -- simplex method -- basic line search algorithm
90C05
Mathematical optimization -- Periodicals
519.7 - Journal URLs:
- http://www.tandfonline.com/toc/gopt20/current ↗
http://www.tandfonline.com/ ↗ - DOI:
- 10.1080/02331934.2014.979324 ↗
- Languages:
- English
- ISSNs:
- 0233-1934
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library DSC - 6275.100000
British Library DSC - BLDSS-3PM
British Library HMNTS - ELD Digital store - Ingest File:
- 2594.xml