Basic Properties of Solutions and Algorithms

David G. Luenberger and Yinyu Ye
Additional contact information
David G. Luenberger: Stanford University
Yinyu Ye: Stanford University

Chapter Chapter 7 in Linear and Nonlinear Programming, 2021, pp 201-234 from Springer

Abstract: Abstract In this chapter we consider optimization problems of the form minimize f(x) subject to x ∈ Ω, where f is a real-valued function and Ω, the feasible set, is a subset of E n. Throughout most of the chapter attention is restricted to the case where Ω = E n, corresponding to the completely unconstrained case, but sometimes we consider cases where Ω is some particularly simple subset of E n.

Date: 2021
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-3-030-85450-8_7

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

DOI: 10.1007/978-3-030-85450-8_7

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 ().