General Quadratic Programming and Its Applications in Response Surface Analysis

Rentsen Enkhbat () and Yadam Bazarsad ()
Additional contact information
Rentsen Enkhbat: National University of Mongolia
Yadam Bazarsad: Mongolian University of Science and Technology

A chapter in Optimization and Optimal Control, 2010, pp 121-137 from Springer

Abstract: Summary In this chapter, we consider the response surface problems that are formulated as the general quadratic programming. The general quadratic programming is split into convex quadratic maximization, convex quadratic minimization, and indefinite quadratic programming. Based on optimality conditions, we propose finite algorithms for solving those problems. As application, some real practical problems arising in the response surface, one of the main part of design of experiment, have been solved numerically by the algorithms.

Keywords: concave programming; quadratic programming; global optimization; response surface problems (search for similar items in EconPapers)
Date: 2010
References: Add references at CitEc
Citations: View citations in EconPapers (1)

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:spochp:978-0-387-89496-6_6

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

DOI: 10.1007/978-0-387-89496-6_6

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().