 Basics of Mathematical ProgrammingHideyuki Azegami ()
Chapter Chapter 3 in Shape Optimization Problems, 2020, pp 105-158 from Springer Abstract: Abstract In Chap. 2 , we discussed the conditions satisfied by a local minimum point (the required conditions of a local minimum point) and the conditions which guarantee it to be a minimum point (sufficient conditions for a minimum point) under a finite-dimensional vector space setting. No detailed explanation, however, was provided regarding the method (solution) for finding the local minimum point. In this chapter, we would like to address this ensuing matter. The computational formulation associated to such a problem is called an optimization problem or a mathematical programmingMathematical programming problem, and active research is being conducted in the academic field referred to as operations research Operations research (OR). Here, we will consider algorithms while showing results that are theoretically obtained or ways to deal with the solution of optimization problems. Much of the content covered here is also valid for abstract optimal design problems in Chap. 7 . In fact, in Chap. 7 we will see how the same algorithms can be adapted for function spaces. Date: 2020 There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it. Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-981-15-7618-8_3 Ordering information: This item can be ordered from DOI: 10.1007/978-981-15-7618-8_3 Access Statistics for this chapter More chapters in Springer Optimization and Its Applications from Springer |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.