Spelling suggestions: "subject:"1inear programming."" "subject:"cinear programming.""
41 |
Multiple Choice Integer Programming with few constraintsKayal, N. M. W. January 1984 (has links)
No description available.
|
42 |
Model generation and sampling algorithms for dynamic stochastic programmingPoire, Xavier Corvera January 1996 (has links)
No description available.
|
43 |
Open Vehicle Routing Problem : description, formulations and heuristic methodsSariklis, Dimitrios January 1997 (has links)
No description available.
|
44 |
An application of linear programming to the scheduling of toll collectorsByrne, 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
|
45 |
An application of linear programming to the scheduling of toll collectors.Byrne, John Leonard. January 1970 (has links) (PDF)
Thesis (Ph.D. 1972) from the Dept. of Mathematics, University of Adelaide.
|
46 |
Fractional domination, fractional packings, and fractional isomorphisms of graphsRubalcaba, Roberto Ramon, Johnson, Peter D. January 2005 (has links) (PDF)
Dissertation (Ph.D.)--Auburn University, 2005. / Abstract. Vita. Includes bibliographic references (p.104-114).
|
47 |
A cascade approach for staircase linear programs with an application to Air Force mobility optimization /Baker, Steven F. January 1997 (has links) (PDF)
Dissertation (Ph.D. in Operations Research) Naval Postgraduate School, June 1997. / Dissertation supervisor, Richard E. Rosenthal. Includes bibliographical references (p. 139-141). Also available online.
|
48 |
A SAT-based planning framework for optimizing resource production /Ventura, Christopher. January 1900 (has links)
Thesis (M.S.)--Oregon State University, 2008. / Printout. Includes bibliographical references (leaves 54-56). Also available on the World Wide Web.
|
49 |
Methods for the numerical solution of the eigenvalue problem for real symetric matricesYamamura, 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
|
50 |
Application of linear programming to forest products planningSitter, 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
|
Page generated in 0.0737 seconds