Duality in Quadratic Programming
Author : William S. Dorn
Publisher :
Page : 26 pages
File Size : 47,38 MB
Release : 1958
Category : Duality (Nuclear physics)
ISBN :
Author : William S. Dorn
Publisher :
Page : 26 pages
File Size : 47,38 MB
Release : 1958
Category : Duality (Nuclear physics)
ISBN :
Author : Michael J. Best
Publisher : CRC Press
Page : 401 pages
File Size : 49,76 MB
Release : 2017-07-12
Category : Business & Economics
ISBN : 1498735770
Quadratic programming is a mathematical technique that allows for the optimization of a quadratic function in several variables. QP is a subset of Operations Research and is the next higher lever of sophistication than Linear Programming. It is a key mathematical tool in Portfolio Optimization and structural plasticity. This is useful in Civil Engineering as well as Statistics.
Author : Elmor L. Peterson
Publisher :
Page : 127 pages
File Size : 30,1 MB
Release : 1968
Category :
ISBN :
The duality theory of geometric programming as developed by Duffin, Peterson and Zener is based on abstract properties shared by certain classical inequalities, such as Cauchy's arithmetic-geometric mean inequality and Holder's inequality. Inequalities with these abstract properties have been termed 'geometric inequalities.' In this paper we establish a new geometric inequality and use it to extend the 'refined duality theory' for 'posynomial' geometric programs. This extended duality theory treats both 'quadratically-constrained quadratic programs' and 'l sub p-constrained l sub p-approximation (regression) problems' through a rather novel and unified formulation of these two classes of programs. This work generalizes some of the work of others on linearly-constrained quadratic programs, and provides to the best of our knowledge the first explicit formulation of duality for constrained approximation problems. Other people have developed duality theories for a larger class of programs, namely all convex programs, but those theories (when applied to the programs considered here) are not nearly as strong as the theory developed here. This theory has virtually all of the desirable features of its analog for posynomial programs, and its proof provides useful computational procedures. (Author).
Author : Elmor L. Peterson
Publisher :
Page : 28 pages
File Size : 11,86 MB
Release : 1969
Category : Geometric programming
ISBN :
Author : William S. Dorn
Publisher : Nabu Press
Page : 28 pages
File Size : 31,10 MB
Release : 2014-01
Category :
ISBN : 9781293451267
This is a reproduction of a book published before 1923. This book may have occasional imperfections such as missing or blurred pages, poor pictures, errant marks, etc. that were either part of the original artifact, or were introduced by the scanning process. We believe this work is culturally important, and despite the imperfections, have elected to bring it back into print as part of our continuing commitment to the preservation of printed works worldwide. We appreciate your understanding of the imperfections in the preservation process, and hope you enjoy this valuable book.
Author : Nazir G. Dossani
Publisher :
Page : 54 pages
File Size : 23,90 MB
Release : 1971
Category : Programming (Mathematics)
ISBN : 9781558690288
Author : Miguel Ángel Goberna
Publisher : Springer Science & Business Media
Page : 392 pages
File Size : 18,83 MB
Release : 2013-11-11
Category : Computers
ISBN : 1475734034
Semi-infinite programming (SIP) deals with optimization problems in which either the number of decision variables or the number of constraints is finite. This book presents the state of the art in SIP in a suggestive way, bringing the powerful SIP tools close to the potential users in different scientific and technological fields. The volume is divided into four parts. Part I reviews the first decade of SIP (1962-1972). Part II analyses convex and generalised SIP, conic linear programming, and disjunctive programming. New numerical methods for linear, convex, and continuously differentiable SIP problems are proposed in Part III. Finally, Part IV provides an overview of the applications of SIP to probability, statistics, experimental design, robotics, optimization under uncertainty, production games, and separation problems. Audience: This book is an indispensable reference and source for advanced students and researchers in applied mathematics and engineering.
Author : Elmor L. Peterson
Publisher :
Page : 33 pages
File Size : 37,9 MB
Release : 1969
Category :
ISBN :
Degenerate quadratically-constrained quadratic programs and l sub p-constrained l sub p-approximation problems are defined and investigates within the framework of extended geometric programming. (Author).
Author : Egon Balas
Publisher :
Page : 14 pages
File Size : 40,15 MB
Release : 1967
Category :
ISBN :
The paper extends the results of 'Duality in Discrete Programming' (1) to the case of quadratic objective functions. The paper is, however, self-contained. A pair of symmetric dual quadratic programs is generalized by constraining some of the variables to belong to arbitrary sets of real numbers. Quadratic all-integer and mixed-integer programs are special cases of these problems. The resulting primal problem is shown, subject to a qualification, to have an optimal solution if and only if the dual has one, and in this case the values of their respective objective functions are equal. Most of the other results of (1) are also shown to carry over to the quadratic case. (Author).
Author : JOSEPH GEORGE ECKER
Publisher :
Page : 124 pages
File Size : 27,16 MB
Release : 1968
Category :
ISBN :