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 172 for “"linear programming problem"”.

  1. The fuzzy linear programming problem

    … to investigate the theory and methods of Fuzzy Linear Programming problems. The stress of the presentation is placed on the transformation methods from fuzzy models to crisp models, and on the sensitivity analysis on fuzzy parameters. Moreover, we extend sensitivity analysis in general cases and …

    ut-knoxville Repository record for The fuzzy linear programming problem (opens in a new tab)

  2. Solving the integer linear programming problem

    … of some selected methods to solve the integer linear programming problem.</p><p>Chapter I introduces the general theory of linear programming. Both the simplex and the dual simplex method are introduced along with a summary of the general steps of the algorithms.</p><p>Chapter II is an …

    ut-knoxville Repository record for Solving the integer linear programming problem (opens in a new tab)

  3. Methods for solution to the integer linear programming problem

    … for the solution to the integer constrained linear programming problem (ILP). To be considered are the method of reducing the feasible solution set by introduction of cutting plane constraints, and the method of reducing the ILP to a knapsack formulation.</p><p>Chapter I introduces the ILP …

    ut-knoxville Repository record for Methods for solution to the integer linear programming problem (opens in a new tab)

  4. Some selected methods for solution to the integer linear programming problem

    … some algorithms for the solution to the integer linear programming problem.</p><p>Chapter I introduces the linear programming problem, the simplex method and the dual simplex method, along with some theoretical basis for these methods.</p><p>Chapter II addressed the primal integer programming …

    ut-knoxville Repository record for Some selected methods for solution to the integer linear programming problem (opens in a new tab)

  5. Necessary conditions for a solution of a non-linear programming problem

    … required for a solution of general non-linear programming problems of the form min{f(x): x є X, g(x) ≤ 0, h(x)=0}; where f is called the objective function, g the inequality constraint and. h the equality constraint, are presented in this thesis. The following cases are studied: (1) X, a …

    ubc Repository record for Necessary conditions for a solution of a non-linear programming problem (opens in a new tab) Download PDF for Necessary conditions for a solution of a non-linear programming problem (opens in a new tab)

  6. Interior Point Methods and Kernel Functions of a Linear Programming Problem

    … thesis the Interior -- Point Method (IPM) for Linear Programming problem (LP) that is based on the generic kernel function is considered. The complexity (in terms of iteration bounds) of the algorithm is first analyzed for a class of kernel functions defined by (3-1). This class is fairly …

    gsu Repository record for Interior Point Methods and Kernel Functions of a Linear Programming Problem (opens in a new tab)

  7. A Composite-Upper Bounding Method of Finding a Feasible Solution to a Linear Programming Problem

    … method of obtaining a feasible solution to a linear programming problem. | The term, composite, refers to a technique for handling negative values of variables in a linear programming problem. It is often desirable to let variables have (temporary) negative values rather than perhaps …

    creighton Repository record for A Composite-Upper Bounding Method of Finding a Feasible Solution to a Linear Programming Problem (opens in a new tab)

  8. Contemporary Approaches to the Solution of the Integer Programming Problem

    … of the methods for solution to the integer linear programming problem. The thesis simultaneously discusses some main approaches that lead to the development of the algorithms for the solution to the integer linear programming problem. Chapter 1 introduces the Generalized Linear Programming …

    ut-knoxville Repository record for Contemporary Approaches to the Solution of the Integer Programming Problem (opens in a new tab)

  9. Análise limite de problemas de estado plano

    … collapse load in plane strain and plane stress problems, based on the Plasticity Limit Theorems. For transforming the limit analysis problem into a linear programming problem, the discretization of the variables into isoparametric finite elements and the sectional linearization of the yield …

    brazil-uerj Repository record for Análise limite de problemas de estado plano (opens in a new tab)

  10. Branch-and-cut for cardinality optimization

    A cardinality constrained linear programming problem (CCLP) is a linear programming problem with an additional constraint which restricts the number of nonnegative variables that may take on positive values. This problem arises in a large variety of applications, such as portfolio optimization, …

    ttu Repository record for Branch-and-cut for cardinality optimization (opens in a new tab)

  11. An Approach to the General Solution of Linear Programming Problems

    The general linear programming problem is one of optimizing a linear functional of several variables subject to a set of linear inequalities which restrict domain. Problems of this sort are of immense practical importance, and yet, until not so long ago, many thought no more exact or general method …

    marquette Repository record for An Approach to the General Solution of Linear Programming Problems (opens in a new tab)

  12. Solving Linear Programming's Transportation Problem

    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.

    unt Repository record for Solving Linear Programming's Transportation Problem (opens in a new tab)

  13. A new class of preconditioners for large-scale linear systems from interior-point methods for linear programming

    … for the iterative solution of the linear systems arising from interior point methods is proposed. For many of these methods, the linear systems come from applying Newton's method on the perturbed Karush-Kuhn-Tucker optimality conditions for the linear programming problem. This leads …

    rice Repository record for A new class of preconditioners for large-scale linear systems from interior-point methods for linear programming (opens in a new tab)

  14. Evaluating exact and approximate algorithms for integer linear programming formulations of MAP inference

    … with declarative constraints. The MAP inference problem in CCM framework can be solved by formulating an Integer Linear Programming problem. This ILP formulation is generally relaxed to an Linear Programming problem by dropping the integrality constraints and making it tractable. In this work, we …

    uiuc Repository record for Evaluating exact and approximate algorithms for integer linear programming formulations of MAP inference (opens in a new tab)

  15. Tiesinės dinaminės sistemos su valdomomis pradinėmis sąlygomis optimizavimas /

    8. Summary (Linear dynamic system optimisation with guided initial conditions) The linear dinamic operating problem with guided initial conditions was solved. The solution of this problem consists of finding the guided function of switching points. Guiding function, according principle of …

    vilnius Repository record for Tiesinės dinaminės sistemos su valdomomis pradinėmis sąlygomis optimizavimas / (opens in a new tab)

  16. Battery Energy Storage System: A Financial Analysis for Microgrids

    … scheduling of microgrid with BESS. The former problem is formulated as a Mixed Integer Linear Programming problem while the latter is formulated as a Linear Programming problem. Both algorithms provide accurate solutions while achieving optimality. The study concludes with a financial model for …

    clemson Repository record for Battery Energy Storage System: A Financial Analysis for Microgrids (opens in a new tab)

  17. MS Excel Solver ir AMPL galimybių palyginimas sprendžiant trupmeninius tiesinius uždavinius /

    … this Bachelor work the derivation of fractional linear tasks are being researched and analyzed via MS Office Excel Solver and AMPL. Described in the application projects for fractional linear programming problem solution development. Provide the results and the comparison of the schemes was care …

    vilnius Repository record for MS Excel Solver ir AMPL galimybių palyginimas sprendžiant trupmeninius tiesinius uždavinius / (opens in a new tab)

  18. ΤΟ ΠΑΝΕΠΙΣΤΗΜΙΑΚΟ ΩΡΟΛΟΓΙΟ ΠΡΟΓΡΑΜΜΑ ΜΑΘΗΜΑΤΩΝ: ΕΠΙΛΥΣΗ ΤΟΥ ΠΡΟΒΛΗΜΑΤΟΣ ΜΕ ΜΕΘΟΔΟΥΣ ΜΑΘΗΜΑΤΙΚΟΥ ΠΡΟΓΡΑΜΜΑΤΙΣΜΟΥ

    … SUBJECT/CLASSROOM-TIME TEACHING SCHEDULE. THE PROBLEM IS FORMULATED AS A 0-1 INTEGER LINEAR PROGRAMMING PROBLEM SO AS THE NUMBER OF VARIABLES TO BE MINIMISED. THE SOLUTION METHODS ARE BASED ON MATHEMATICAL PROGRAMMING TECHNIQUES, NAMELY BRANCH AND BOUND, PROPERLY MODIFIED. COMPUTATIONAL RESULTS …

    greece Repository record for ΤΟ ΠΑΝΕΠΙΣΤΗΜΙΑΚΟ ΩΡΟΛΟΓΙΟ ΠΡΟΓΡΑΜΜΑ ΜΑΘΗΜΑΤΩΝ: ΕΠΙΛΥΣΗ ΤΟΥ ΠΡΟΒΛΗΜΑΤΟΣ ΜΕ ΜΕΘΟΔΟΥΣ ΜΑΘΗΜΑΤΙΚΟΥ ΠΡΟΓΡΑΜΜΑΤΙΣΜΟΥ (opens in a new tab)

Page 1 of 9