• 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.
31

Toeplitz matrices and interior point methods for linear programming

Castillo, Ileana 05 1900 (has links)
No description available.
32

2-lattice polyhedra

Chang, Shiow-Yun 08 1900 (has links)
No description available.
33

The analytic center cutting plane method with semidefinite cuts /

Oskoorouchi, Mohammad R. January 2002 (has links)
We propose an analytic center cutting plane algorithm for semidefinite programming (SDP). Reformulation of the dual problem of SDP into an eigenvalue optimization, when the trace of any feasible primal matrix is a positive constant, is well known. We transform the eigenvalue optimization problem into a convex feasibility problem. The problem of interest seeks a feasible point in a bounded convex set, which contains a full dimensional ball with &egr;(<1) radius and is contained in a compact convex set described by matrix inequalities, known as the set of localization. At each iteration, an approximate analytic center of the set of localization is computed. If this point is not in the solution set, an oracle is called to return a p-dimensional semidefinite cut. The set of localization then, is updated by adding the semidefinite cut through the center. We prove that the analytic center is recovered after adding a p-dimensional semidefinite cut in O(plog(p + 1)) damped Newton's iteration and that the ACCPM with semidefinite cuts is a fully polynomial approximation scheme. We report the numerical result of our algorithm when applied to the semidefinite relaxation of the Max-Cut problem.
34

SUCCESSIVE TWO SEGMENT SEPARABLE PROGRAMMING FOR NONLINEAR MINIMAX OPTIMIZATION.

Dunatunga, Manimelwadu Samson, 1958- January 1986 (has links)
No description available.
35

Extreme point methods for infinite linear programming

Lewis, A. January 1986 (has links)
No description available.
36

Application of linear programming to forest products planning

Sitter, Robert Moris January 1969 (has links)
The managements of integrated forest products firms in British Columbia and elsewhere must make many involved decisions in order to effectively plan the intermediate-range (one year) operations of their firms. The production systems of the forest industry involve complex allocations of many resources among competing activities. In addition, interdependencies between processes exist and frequently products are transferred between divisions. This thesis explains and illustrates how linear programming may be used to assist managements of integrated forest products firms in their planning activities. In particular, the linear programming technique is used to find suggested optimal operating plans for the total range of the firm's operations — from woodlands, through production plants to sales operations. The specific details of model construction, the mathematical programming, and the problems encountered are illustrated by a hypothetical forest products firm. A linear model has been developed for the hypothetical firm, computer solutions have been interpreted, and suggestions have been made for implementation of results. Although the author does not attempt to quantify the value of linear programming to a firm's profitability, the many explanations and illustrations serve to support the view that managerial effectiveness is enhanced through use of the technique. Decisions regarding intermediate-range planning can be made by managers with an increased understanding of the complex relationships within their firm's production and sales functions. In presenting this thesis in partial fulfilment of the requirements for an advanced degree at the University of British Columbia, I agree that the Library shall make it freely available for reference and Study. I further agree that permission for extensive copying of this thesis for scholarly purposes may be granted by the Head of my Department or by his representatives. It is understood that copying or publication of this thesis for financial gain shall not be allowed without my written permission. / Business, Sauder School of / Graduate
37

Linear programming analysis applied to a selected plywood manufacturing firm

Lee, Meng-Hye January 1968 (has links)
A combination of many grades of veneer may be jointly produced by peeling any one type of logs. This means that the plywood manufacturer can not really know the profit margins of the panels he produces. And for most of the manufacturers, the cost of the logs constitutes about 65% of the total cost of producing the plywood panels. Consequently, the manufacturer finds it very difficult to select his sales strategy and to price his panels. The plywood manufacturer also has opportunities to minimize his log cost and processing cost by selecting the right combination of logs to peel and using the right constructions in laying up the panels. Linear programming techniques are used in this study to provide an approach to the above mentioned problems for a selected plywood manufacturer. Through this, it is hoped as well to provide an examination of the way to use linear programming techniques and an evaluation of their usefulness as management tools in plywood manufacturing. A survey of the reported experience of some plywood manufacturers indicated that the use of L. P. had been instrumental in saving some hundreds of thousands of dollars per annum for some manufacturers. An L. P. model was constructed for the largest of the four mills of the Case Company, using the operating situations predicted for the year 1967. Such problems (and their solutions) as were encountered in defining, identifying and measuring the variable process costs and the need for making simplifying assumptions were examined. The L. P. model seeks to optimize the choice of panel output, the choice of log input and the choice of panel constructions simultaneously because these three decisions are interrelated and somewhat interdependent. The L. P. analysis suggests that about 30% of the dollar sales of the Case Mill in 1967 were made in unprofitable (thin) panels. Even after allowing for possible over estimation in measuring the variable processing cost, this may call for a thorough re-examination of the sales strategy and the panel pricing system. To produce the panel output selected for 1967, the best log combination apparently includes the use of a much higher proportion of Fir Peeler #2 and Sawlog #3, Interior Fir and Hemlock-Balsam Mix than was used by the Company in its mill. Also, the model suggests proportions of Fir Peeler #1, #4 and S. F.P. might be much lower than what the Company tended to use. These tentative findings may have significant implications for choosing log acquisition policies. The model suggests the choice in panel construction may be to peel Peeler logs for .104" high quality veneer, Interior Fir for .130" veneer and other low quality logs for .171" core veneer. It also suggests down-grading some veneer and using some subsidiary panel constructions so as to utilize fully the total supply of veneer from the logs peeled. The usefulness of the L.P. analysis is fully realized by making a comprehensive post-optimal analysis of the sensitivity of the optimality of the solution to various changes in the log supply and/or panel demand and/or processing cost situations. This analysis may enable the company to determine which of the operating factors seem crucial in determining the profitability of the panels and what may constitute the best log combination to use. From this, the manufacturer could possibly know when and how to adapt his program of operation in response to any future changes in (or any revision in the forecast of) the operating situation. This analysis is also helpful in gauging the importance of the assumptions made when constructing the model. No comprehensive sensitivity analysis was carried out in this study. However, recommendations regarding appropriate post-optimal analyses are presented. Lastly, the study concludes by presenting an L. P. model of possible use to analyze the four mills of the Company together, recognizing the possibilities of specialization and cooperation among the mills. / Business, Sauder School of / Graduate
38

Methods for the numerical solution of the eigenvalue problem for real symetric matrices

Yamamura, Eddie Akira January 1962 (has links)
The purpose of this thesis is to give a survey of the methods currently used to solve the numerical eigenvalue problem for real symmetric matrices. On the basis of the advantages and disadvantages inherent in the various methods, it is concluded that Householder's method is the best. Since the methods of Givens, Lanczos, and Householder use the Sturm sequence bisection algorithm as the final stage, a complete theoretical discussion of this process is included. Error bounds from a floating point error analysis (due to Ortega), for the Householder reduction are given. In addition, there is a complete error analysis for the bisection process. / Science, Faculty of / Mathematics, Department of / Graduate
39

Solving Linear Programming's Transportation Problem

Culp, William E. 05 1900 (has links)
A special case of the linear programming problem, the transportation problem, is the subject of this thesis. The development of a solution to the transportation problem is based on fundamental concepts from the theory of linear algebra and matrices.
40

Theorems of structural and geometric variation for linear and nonlinear finite element analysis

Abu Kassim, Abdul Majid January 1985 (has links)
No description available.

Page generated in 0.126 seconds