• 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 general linear programming model of the manufacturing firm /

Moore, William Shepherd January 1971 (has links)
No description available.

A linear programming approach to water supply alternatives /

Kohler, Fred Eric January 1971 (has links)
No description available.

Application of Control Allocation Methods to Linear Systems with Four or More Objectives

Beck, Roger Ezekiel 24 June 2002 (has links)
Methods for allocating redundant controls for systems with four or more objectives are studied. Previous research into aircraft control allocation has focused on allocating control effectors to provide commands for three rotational degrees of freedom. Redundant control systems have the capability to allocate commands for a larger number of objectives. For aircraft, direct force commands can be applied in addition to moment commands. When controls are limited, constraints must be placed on the objectives which can be achieved. Methods for meeting commands in the entire set of of achievable objectives have been developed. The Bisecting Edge Search Algorithm has been presented as a computationally efficient method for allocating controls in the three objective problem. Linear programming techniques are also frequently presented. This research focuses on an effort to extend the Bisecting Edge Search Algorithm to handle higher numbers of objectives. A recursive algorithm for allocating controls for four or more objectives is proposed. The recursive algorithm is designed to be similar to the three objective allocator and to require computational effort which scales linearly with the controls. The control allocation problem can be formulated as a linear program. Some background on linear programming is presented. Methods based on five formulations are presented. The recursive allocator and linear programming solutions are implemented. Numerical results illustrate how the average and worst case performance scales with the problem size. The recursive allocator is found to scale linearly with the number of controls. As the number of objectives increases, the computational time grows much faster. The linear programming solutions are also seen to scale linearly in the controls for problems with many more controls than objectives. In online applications, computational resources are limited. Even if an allocator performs well in the average case, there still may not be sufficient time to find the worst case solution. If the optimal solution cannot be guaranteed within the available time, some method for early termination should be provided. Estimation of solutions from current information in the allocators is discussed. For the recursive implementation, this estimation is seen to provide nearly optimal performance. / Ph. D.

Experimental Software Package for Linear Programming

Fogal, Deborah S. 01 January 1985 (has links)
A software package for linear programming has been developed using the revised simplex and dual simplex algorithms. The design of the program incorporates an experimental change in the dual simplex algorithm. If the entered problem is not primal feasible, a modified dual simplex algorithm is used. The traditional dual simplex method requires an initial dual feasible basis and maintains feasibility throughout its application. The experimental change is to ignore this criteria of dual feasibility. The objective then becomes to obtain primal feasibility. Once this is attained, the revised simplex algorithm is applied to obtain optimality, if this has not been reached through use of the dual. This experimental change redirects the goal of the dual simplex method from obtaining objective function optimality to obtaining primal feasibility. Program testing has shown the experimental design to produce correct results for a variety of linear programming problems. The program is written for an IBM PC using PASCAL for coding. Spreadsheet format and menus provide ease in problem input and output. Devices for output of problem and solution are printer, screen and/or disk. A problem can be saved and retrieved at a later time for editing.

The computer and linear programming as important instruments for decision making assistance for farmers /

Harter, Walter George January 1967 (has links)
No description available.

Efficient implementations of the primal-dual method

Osiakwan, Constantine N. K. January 1984 (has links)
No description available.

Linear programming design of recursive digital filters.

Swanton, David Francis. January 1973 (has links)
No description available.

Recursive programming and production response

Day, Richard Hollis, January 1963 (has links)
Thesis--Harvard, 1961.

Scheduling ammunition loading and unloading for U.S. Navy ships in San Diego /

Billings, Roger L. January 2005 (has links) (PDF)
Thesis (M.S. in Operations Research)--Naval Postgraduate School, March 2005. / Thesis Advisor(s): Robert F. Dell. Includes bibliographical references (p. 33-35). Also available online.

Iterative linear programming for linear complementarity and related problems

Shiau, Tzong-Huei. January 1900 (has links)
Thesis (Ph. D.)--University of Wisconsin--Madison, 1983. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 106-111).

Page generated in 0.0951 seconds