Nonlinear Programming

H. A. Eiselt and Carl-Louis Sandblom
Additional contact information
H. A. Eiselt: University of New Brunswick
Carl-Louis Sandblom: Dalhousie University

Chapter 4 in Operations Research, 2022, pp 143-159 from Springer

Abstract: Abstract In the Introduction to Linear Programming in Sect. 2.1 in this volume, we outlined that the objective function(s) and the constraints in linear programming are assumed to be linear functions in the variables. In this chapter, we drop this assumption and only assume divisibility and the deterministic property. Given that, we can view nonlinear programming as a generalization of linear programming. Another important distinction between linear and nonlinear programming is that in nonlinear programming, constraints are not necessarily needed to ensure finite optima as is the case in linear programming. For instance, the nonlinear objective

Date: 2022
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:sptchp:978-3-030-97162-5_4

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

DOI: 10.1007/978-3-030-97162-5_4

Access Statistics for this chapter

More chapters in Springer Texts in Business and Economics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().