Basic Notions and Definitions

Giorgio Giorgi (), Bienvenido Jiménez () and Vicente Novo ()
Additional contact information
Giorgio Giorgi: University of Pavia
Bienvenido Jiménez: National University of Distance Education
Vicente Novo: National University of Distance Education

Chapter Chapter 1 in Basic Mathematical Programming Theory, 2023, pp 1-22 from Springer

Abstract: Abstract It is well-known that the central problem of mathematical programming is that of minimizing or maximizing a given numerical function of several variables, where the variables are free to move over the whole domain of the function or (more usually) are constrained by a system of constraints. Mathematical programming, called also nonlinear programming, can be viewed as that field of optimization theory which treats static and finite-dimensional optimization problems. It seems that the term “mathematical programming” was first introduced by the American economist Robert Dorfman in 1949, as a generalization of the term “linear programming”, introduced by the American mathematician George B. Dantzig a couple of years before. The term “nonlinear programming” appears for the first time in 1951 in the title of the famous pioneering paper of Kuhn and Tucker [1].

Date: 2023
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-031-30324-1_1

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

DOI: 10.1007/978-3-031-30324-1_1

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