Sphere Methods for LP

Katta G. Murty ()
Additional contact information
Katta G. Murty: University of Michigan

Chapter Chapter 8 in Optimization for Decision Making, 2010, pp 417-444 from Springer

Abstract: Abstract For solving an optimization problem in which an objective function z(x) is to be minimized subject to constraints, starting with an initial feasible solution, a method that works by generating a sequence of feasible solutions along which the objective value z(x) strictly decreases is known as a descent algorithm. Strict improvement in the objective value in each step is an appealing property, and hence descent algorithms are the most sought after. If the original objective function is to be maximized instead, algorithms that maintain feasibility and improve the objective value (i.e., here, increasing its value) in every step are also referred to as descent algorithms.

Keywords: Feasible Solution; Step Length; Line Search; Objective Plane; Ball Center (search for similar items in EconPapers)
Date: 2010
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-1-4419-1291-6_8

Ordering information: This item can be ordered from
http://www.springer.com/9781441912916

DOI: 10.1007/978-1-4419-1291-6_8

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().