• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 418
  • 300
  • 59
  • 50
  • 24
  • 12
  • 10
  • 10
  • 9
  • 7
  • 6
  • 6
  • 6
  • 6
  • 6
  • Tagged with
  • 1075
  • 1075
  • 323
  • 275
  • 266
  • 168
  • 127
  • 116
  • 104
  • 104
  • 100
  • 91
  • 81
  • 80
  • 77
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

A solution to optimization problems with discontinuities

McLennan, Clyde Jack, 1939- January 1967 (has links)
No description available.

The specification and synthesis of high-order control systems

Dial, Joseph Hubbard, 1939- January 1968 (has links)
No description available.

Complex quadratic optimization via semidefinite programming: models and applications. / CUHK electronic theses & dissertations collection

January 2005 (has links)
Finally, as combinatorial applications of complex quadratic optimization; we consider Max 3-Cut with fixed nodes constraints, Max 3-Dicut with weight constraints, Max 3-XOR, and so on, and present corresponding bounds on the approximation ratios. / Quadratic optimization problems with complex-valued decision variables, in short called complex quadratic optimization problems, find many applications in engineering. In this dissertation, we study several instructive models of complex quadratic optimization, as well as its applications in combinatorial optimization. The tool that we use is a combination of semidefinite programming (SDP) relaxation and randomization technique, which has been well exploited in the last decade. Since most of the optimization models are NP-hard in nature, we shall design polynomial time approximation algorithms for a general model, or polynomial time exact algorithms for some restricted instances of a general model. / To enable the analysis, we first develop two basic theoretical results: one is the probability formula for a bivariate complex normal distribution vector to be in a prescribed angular region, and the other one is the rank-one decomposition theorem for complex positive semidefinite matrices. The probability formula enables us to compute the expected value of a randomized (with a specific rounding rule) solution based on an optimal solution of the SDP relaxation problem, while the rank-one decomposition theorem provides a new proof of the complex S -lemma and leads to novel deterministic rounding procedures. / With the above results in hand, we then investigate the models and applications of complex quadratic optimization via semidefinite programming in detail. We present an approximation algorithm for a convex quadratic maximization problem with discrete complex decision variables, where the approximation analysis is based on the probability formula. Besides, an approximation algorithm is proposed for a non-convex quadratic maximization problem with discrete complex decision variables. Then we study a limit of the model, i.e., a quadratic maximization problem with continuous unit module decision variables. The problem is shown to be strongly NP-hard. Approximation algorithms are described for the problem, including both convex case and non-convex case. Furthermore, if the objective matrix has a sign structure, then a stronger approximation result is shown to hold. In addition, we use the complex matrix decomposition theorem to solve complex quadratically constrained complex quadratic programming. We consider several interesting cases for which the corresponding SDP relaxation admits no gap with the true optimal value, and consequently, this yields polynomial time procedures for solving those special cases of complex quadratic optimization. / Huang Yongwei. / "August 2005." / Adviser: Shuzhong Zhang. / Source: Dissertation Abstracts International, Volume: 67-07, Section: B, page: 4033. / Thesis (Ph.D.)--Chinese University of Hong Kong, 2005. / Includes bibliographical references (p. 142-155). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Electronic reproduction. [Ann Arbor, MI] : ProQuest Information and Learning, [200-] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstract in English and Chinese. / School code: 1307.

A study an analysis of stochastic linear programming

Foes, Chamberlain Lambros 01 May 1970 (has links)
This essay investigates the concept of linear programming in general and linear stochastic programming in particular. Linear stochastic programming is described as the model where the parameters of the linear programming admit random variability. The first three chapters present through a set-geometric approach the foundations of linear programming. Chapter one describes the evolution of the concepts which resulted in the adoption of the model. Chapter two describes the constructs in n-dimensional euclidian space which constitute the mathematical basis of linear programs, and chapter three defines the linear programming model and develops the computational basis of the simplex algorithm. The second three chapters analyze the effect of the introduction of risk into the linear programming model. The different approaches of estimating and measuring risk are studied and the difficulties arising in formulating the stochastic problem and deriving the equivalent deterministic problems are treated from the theoretical and practical point of view. Multiple examples are given throughout the essay for clarification of the salient points.

Interior point based continuous methods for linear programming

Sun, Liming 01 January 2012 (has links)
No description available.

An application of linear programming to the scheduling of toll collectors

Byrne, John Leonard January 1970 (has links)
iv, 115 leaves : ill. / Title page, contents and abstract only. The complete thesis in print form is available from the University Library. / Thesis (Ph.D.1972) from the Dept. of Mathematics, University of Adelaide

Computer Solution of Linear Programming Problems Using the Decomposition Algorithm

Kraslawsky, Walter Paul 01 January 1973 (has links)
No description available.

The linear programming problem /

Dessouky, Mohamed Ibrahim January 1956 (has links)
No description available.

Algorithms for the hand-computation solution of the transhipment problem and maximum flow in a restricted network /

Brown, Edward A. January 1959 (has links)
No description available.

On a special class of problems in integer linear programming /

Nelson, Larry Dean January 1965 (has links)
No description available.

Page generated in 0.3174 seconds