Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 654 for “"Linear Program"”.

  1. A robust linear program solver for projectahedra

    Linear programming has a wide range of applications, optimization-related problems being one of them. Important concerns in linear programming are efficiency, robustness, and accuracy. Linear programming is used in a reachability analysis tool called Coho [GM99] for dynamical systems. Previous …

    ubc Repository record for A robust linear program solver for projectahedra (opens in a new tab) Download PDF for A robust linear program solver for projectahedra (opens in a new tab)

  2. An integer linear program to schedule an Army installation's maneuver training

    This thesis develops an integer linear program called MSAMT (Model to Schedule Army Maneuver Training) to schedule an Army installation's maneuver training. We demonstrate MSAMT using a data set containing 261 platoon-level, 67 company-level and 18 battalion-level units, and 7 major training areas …

    nps Repository record for An integer linear program to schedule an Army installation's maneuver training (opens in a new tab)

  3. An integer linear program to combine container handling and yard crane deployment

    … terminal. This thesis establishes an Integer Linear Program (ILP) to combine container handling and yard crane deployment for Rubber Tired Gantry Cranes (RTG). Using real world data, we test the ILP for two different yard sizes. We find the resulting ILPs difficult to solve directly. In order …

    nps Repository record for An integer linear program to combine container handling and yard crane deployment (opens in a new tab)

  4. ANALYSIS OF OBJECTIVE SPACE IN MULTIPLE OBJECTIVE OPTIMIZATION (LINEAR PROGRAM, DUALITY, HYPERPLANE)

    The multiple objective linear program (MOLP) will be considered as: maximize Cx subject to x (ELEM) X (INTERSECT) K where C (ELEM) B(U,Z) (i.e. C is a bounded linear operator from a topological linear space U to a topological linear space Z), X = x (ELEM) U: Ax = b, A (ELEM) B(U,V), V a topological …

    nebraska Repository record for ANALYSIS OF OBJECTIVE SPACE IN MULTIPLE OBJECTIVE OPTIMIZATION (LINEAR PROGRAM, DUALITY, HYPERPLANE) (opens in a new tab)

  5. Neural Network Approaches for Integer and Linear Program Value Functions: Theory and Applications

    … methods for approximating the value functions of linear and integer programs, which describe how optimal values change with problem's objectives or right-hand side vectors. For linear programs, we propose a structured neural architecture based on a new representation theorem for the generalized …

    rice Repository record for Neural Network Approaches for Integer and Linear Program Value Functions: Theory and Applications (opens in a new tab)

  6. FINITE DISJUNCTIVE PROGRAMMING METHODS FOR GENERAL MIXED INTEGER LINEAR PROGRAMS

    … dissertation, a finitely convergent disjunctive programming procedure, the Convex Hull Tree (CHT) algorithm, is proposed to obtain the convex hull of a general mixed–integer linear program with bounded integer variables. The CHT algorithm constructs a linear program that has the same optimal …

    arizona-thes Repository record for FINITE DISJUNCTIVE PROGRAMMING METHODS FOR GENERAL MIXED INTEGER LINEAR PROGRAMS (opens in a new tab)

  7. An efficient simplex-based method for solving large linear programs

    … of solving specific classes of large-scale linear programs is presented. The structure of both staircase and block-angular linear programs is exploited to construct an advanced or "crash" basis to be used with a simplex-based linear program solver. First, the constraint matrix is decomposed …

    rice Repository record for An efficient simplex-based method for solving large linear programs (opens in a new tab)

  8. Coho : a verification tool for circuit verification by reachability analysis

    … is a verification tool for systems modeled by nonlinear ordinary differential equations (ODEs). Verification is performed using reachability analysis. The reachable space is represented by projectagons which are the polyhedron described by their projection onto two dimensional subspace. COHO …

    ubc Repository record for Coho : a verification tool for circuit verification by reachability analysis (opens in a new tab) Download PDF for Coho : a verification tool for circuit verification by reachability analysis (opens in a new tab)

  9. Determining the optimal prescribed load for the U. S. Marine Corps direct support artillery battery using linear programming.

    … transportation in a given tactical situation. Linear programing is a tool which the batten' commander can use to help solve this important problem. This thesis provides a linear program to assist him in this solution. In addition, with slight modification, this linear program can be of use to …

    nps Repository record for Determining the optimal prescribed load for the U. S. Marine Corps direct support artillery battery using linear programming. (opens in a new tab)

  10. Intraregional Efficiency of Production Decisions and Interregional Efficiency of Input Use in Bolivian Agriculture

    … production regions called departments. A linear program maximizing model was generated for the major crops produced in each department. Land, labor, irrigation, and capital were the input coefficients used in the models. They produced a net return to management, land, and fixed costs …

    utahstate Repository record for Intraregional Efficiency of Production Decisions and Interregional Efficiency of Input Use in Bolivian Agriculture (opens in a new tab)

  11. Branch-and-cut for complementarity-constrained linear programs

    A Complementarity-Constrained Linear Program (CCLP) is a linear program which has additional constraints called complementarity constraints. Which are such that, for some sets of variables, at most one variable can be positive. Numerous real world problems, such as resource allocation problems, can …

    ttu Repository record for Branch-and-cut for complementarity-constrained linear programs (opens in a new tab)

  12. Evaluation of a computer-administered challenging teaching strategy.

    … challenging teaching strategy with those of a linear program, also computer-administered. A linear program was considered to exemplify an unchallenging approach. Both programs taught elementary base five arithmetic to Grade Six students, the students being assigned to the programs at random. …

    ubc Repository record for Evaluation of a computer-administered challenging teaching strategy. (opens in a new tab) Download PDF for Evaluation of a computer-administered challenging teaching strategy. (opens in a new tab)

  13. Optimal monitoring and mitigation of systemic risk in lending networks

    … we show that this problem is equivalent to a linear program. We develop a duality-based distributed algorithm to solve it which is useful for applications where it is desirable to avoid centralized data gathering and computation. Since some applications require forecasting and planning for a …

    purdue-thes Repository record for Optimal monitoring and mitigation of systemic risk in lending networks (opens in a new tab)

  14. The boundary control of the wave equation

    … solution of optimal control problems governed by linear and nonlinear wave equations and the estimation of the errors in approximating these solutions. First, the boundary control of a linear wave equation with an integral performance criterion and fixed final states is considered. This problem is …

    whiterose Download PDF for The boundary control of the wave equation (opens in a new tab)

  15. RUNTIME ANALYSIS OF BENDERS DECOMPOSITION AND DUAL ILP ALGORITHMS AS APPLIED TO COMMON NETWORK INTERDICTION PROBLEMS

    … Benders decomposition and a dual integer linear program approach, to compare their computational efficiency on the shortest path and maximum flow interdiction problems. We construct networks using two operationally meaningful structures: a grid structure designed to represent an urban …

    nps Repository record for RUNTIME ANALYSIS OF BENDERS DECOMPOSITION AND DUAL ILP ALGORITHMS AS APPLIED TO COMMON NETWORK INTERDICTION PROBLEMS (opens in a new tab)

  16. Linear programming algorithms for detecting separated data in binary logistic regression models

    … of separation. The new algorithm is based on a linear program with a nonnegative objective function that has a positive optimal value when separation is present among the sample points. We compare several approaches for solving this linear program and find that a method based on determining the …

    oxford Repository record for Linear programming algorithms for detecting separated data in binary logistic regression models (opens in a new tab)

Page 1 of 33