Preview

Linear Progra`Mming

Good Essays
Open Document
Open Document
40935 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
Linear Progra`Mming
3
Introduction to Linear
Programming
The development of linear programming has been ranked among the most important scientific advances of the mid-20th century, and we must agree with this assessment. Its impact since just 1950 has been extraordinary. Today it is a standard tool that has saved many thousands or millions of dollars for most companies or businesses of even moderate size in the various industrialized countries of the world; and its use in other sectors of society has been spreading rapidly. A major proportion of all scientific computation on computers is devoted to the use of linear programming. Dozens of textbooks have been written about linear programming, and published articles describing important applications now number in the hundreds.
What is the nature of this remarkable tool, and what kinds of problems does it address? You will gain insight into this topic as you work through subsequent examples. However, a verbal summary may help provide perspective. Briefly, the most common type of application involves the general problem of allocating limited resources among competing activities in a best possible (i.e., optimal) way. More precisely, this problem involves selecting the level of certain activities that compete for scarce resources that are necessary to perform those activities. The choice of activity levels then dictates how much of each resource will be consumed by each activity. The variety of situations to which this description applies is diverse, indeed, ranging from the allocation of production facilities to products to the allocation of national resources to domestic needs, from portfolio selection to the selection of shipping patterns, from agricultural planning to the design of radiation therapy, and so on. However, the one common ingredient in each of these situations is the necessity for allocating resources to activities by choosing the levels of those activities.
Linear programming uses a mathematical model to



References: 9th ed., West, St. Paul, MN, 2000, chaps. 2, 4. 2. Gass, S.: An Illustrated Guide to Linear Programming, Dover Publications, New York, 1990. 3. Hillier, F. S., M. S. Hillier, and G. J. Lieberman: Introduction to Management Science: A Modeling and Case Studies Approach with Spreadsheets, Irwin/McGraw-Hill, Burr Ridge, IL, 2000, chaps 4. LINGO User’s Guide, LINDO Systems, Inc., Chicago, IL, e-mail: info@lindo.com, 1999. 5. MPL Modeling System (Release 4.0) manual, Maximal Software, Inc., Arlington, VA, e-mail: info@maximal-usa.com, 1998. 6. Williams, H. P.: Model Building in Mathematical Programming, 3d ed., Wiley, New York, 1990.

You May Also Find These Documents Helpful

  • Satisfactory Essays

    Busn312 Hw3A

    • 727 Words
    • 3 Pages

    Linear programming problems have a.|linear objective functions, non-linear constraints.| b.|non-linear objective functions, non-linear constraints.| c.|non-linear objective functions, linear constraints.| d.|linear objective functions, linear constraints.| ____C 7. The first step in formulating a linear programming problem is a.|Identify any upper or lower bounds on the decision variables.| b.|State the constraints as linear combinations of the decision variables.| c.|Understand the problem.| d.|Identify the decision variables.| e.|State the objective…

    • 727 Words
    • 3 Pages
    Satisfactory Essays
  • Better Essays

    Acme

    • 1450 Words
    • 8 Pages

    References: Knode, C.S. (2011). Linear programming - Part 1 - Formulating the problem [video]. Retrieved from: http://vimeo.com/duffer44/linear-programming-part-1…

    • 1450 Words
    • 8 Pages
    Better Essays
  • Powerful Essays

    Work must be allocated taking into account the availability of resources and the skills of employees.…

    • 3829 Words
    • 13 Pages
    Powerful Essays
  • Satisfactory Essays

    Mat 540 Quiz 4

    • 1474 Words
    • 6 Pages

    The standard form for the computer solution of a linear programming problem requires all variables to be to the right and all numerical values to be to the left of the inequality or equality sign…

    • 1474 Words
    • 6 Pages
    Satisfactory Essays
  • Good Essays

    6- A non-unique solution to a linear program indicates the existence of more than one optimal point with different values of the decision variables but the same value of the objective function.…

    • 715 Words
    • 3 Pages
    Good Essays
  • Powerful Essays

    One way to consider resources is to take them into account when drawing the logical relationships among activities in the network diagram. In addition to showing the technical constraints among activities, the network logic can also take into account resource constraints. The sequence of activities can be drawn to reflect the limited availability of a number of resources. If resources are to be considered in planning, it’s necessary to indicate the amounts and types of resources needed to perform each activity. For this reason, a resource profile is often developed.…

    • 2049 Words
    • 9 Pages
    Powerful Essays
  • Satisfactory Essays

    Linear programming, the ability to find the smallest or biggest possible value under some constraints, is used in a typical optimization problem. In business this method helps to optimize solutions for politics, transportation scheduling, hospital stuffing, purchasing and many other problems. In biotechnology the same equation is used to optimize cell-factories, enabling the production of drugs, plastics, or any desired products.…

    • 501 Words
    • 3 Pages
    Satisfactory Essays
  • Satisfactory Essays

    4. What do you predict will happen to both the availability of the resource and consequences of using it as the…

    • 358 Words
    • 2 Pages
    Satisfactory Essays
  • Powerful Essays

    Whittle Training

    • 10006 Words
    • 41 Pages

    Jeff Whittle brought pit optimisation of age with the first fully implemented LerchsGrossmann algorithm. The graph-maximisation approach has a number of advantages over the LP formulation illustrated above. The primary advantage is that the pit optimisation problem can be coded in any language, such as Fortran in the case of early Whittle products. As such, it is not dependent on LP solution algorithms which can vary dramatically in solution speed given their implementation and application. No doubt, Whittle’s early implementations were far faster than solving the LP equivalent using the available Simplex algorithms. Currently, 4X is one of several competing pit optimisation products on the market but is the most widely used and recognised. The following sections are not designed as a Whittle tutorial. Rather, we introduce 4X as an excellent example of the methodology of pushback generation as a means of illustrating the optimisation process for a very large example. While we could expand upon the LP-based example of the previous section, doing so would require a full version of AMPL/Cplex and far more depth in programming than is required to understand the topic. 4X follows the same basic approach as with the LP implementation: pushback generation using a series of price increments. This is supplemented by comprehensive reporting and graphing of results coupled with scheduling algorithms aimed at providing guidance in the selection of pushbacks from among the set of pits generated by applying the price factors. It should be noted that a certain amount of educated trial-and-error is required in using 4X and that the scheduling algorithms are not provably optimal but are heuristic which in some cases provide very good, if not optimal, solutions. Still, as we will see, there is no direct approach to selecting a set of optimised pit limits as pushbacks and the…

    • 10006 Words
    • 41 Pages
    Powerful Essays
  • Powerful Essays

    Linear Solution

    • 6098 Words
    • 25 Pages

    Three points can be made about the two blending examples in this chapter. First, both the diet and fuel blending problems presented here are tiny compared to huge real-world blending problems. But they do provide some sense of the issues to be faced.…

    • 6098 Words
    • 25 Pages
    Powerful Essays
  • Powerful Essays

    Convex Optimization Convex Optimization Stephen Boyd Department of Electrical Engineering Stanford University Lieven Vandenberghe Electrical Engineering Department University of California, Los Angeles cambridge university press Cambridge, New York, Melbourne, Madrid, Cape Town, Singapore, S˜o Paolo, Delhi a Cambridge University Press The Edinburgh Building, Cambridge, CB2 8RU, UK Published in the United States of America by Cambridge University Press, New York http://www.cambridge.org Information on this title: www.cambridge.org/9780521833783 c Cambridge University Press 2004 This publication is in copyright. Subject to statutory exception and to the provisions of relevant collective licensing agreements, no reproduction of any part may take place without the written permission of Cambridge University Press.…

    • 252818 Words
    • 1012 Pages
    Powerful Essays
  • Good Essays

    Plant Layout

    • 2443 Words
    • 10 Pages

    Integration of men, money, materials and machines and support services in order to get the optimum output of resources.…

    • 2443 Words
    • 10 Pages
    Good Essays
  • Good Essays

    Metodo Simplex

    • 11321 Words
    • 46 Pages

    2 INTRODUCCIÓN Este trabajo tiene como propósito proveer ayuda al estudiante para que pueda comprender y manejar más efectivamente el método símplex de programación lineal. Ilustraremos la aplicación a situaciones de maximización, minimización y análisis de sensibilidad. El Método Símplex como herramienta de programación lineal fue desarrollado para la época de los años cuarenta por George Dantzing, un joven matemático. El método constituye una forma sistemática y de búsqueda intensiva a través de todas las posibles soluciones para obtener una solución óptima. Ello resulta de gran utilidad debido a su eficiencia. Además es fácil programarlo en una computadora. En contraste con el análisis gráfico, este método permite el uso de muchas variables. También permite la aplicación de cantidades de restricciones lineales con signos; mayores e igual, menores e igual y de igualdad. En comparación con el método gráfico, el método símplex tiene como punto de partida el origen siendo este la solución inicial al problema. El método prueba todos los puntos extremos gráficos aunque no necesariamente se detiene en todos los vértices. Por otro lado utiliza el concepto de álgebra de matrices en una serie de tablones. EL PROBLEMA DE MAXIMIXACIÓN SÍMPLEX FORMULACIÓN INICIAL Utilizando el siguiente ejemplo estableceremos la formulación inicial símplex y demostraremos la mecánica del método y su interpretación. El gerente de la Relojería la Torre desea conocer la ganancia máxima que se puede obtener de la producción y venta de dos clases de relojes económicos digitales de pulsera. La ganancia que se obtiene por la producción y venta de un reloj de hombre es de $4 y de $6 para un reloj de mujer. La empresa cuenta con 120 horas semanales para la producción de los relojes y 100 horas para la inspección y empaque de estos. La fabricación de un reloj de hombre requiere 2 horas de producción y 2 horas de…

    • 11321 Words
    • 46 Pages
    Good Essays
  • Good Essays

    Protac

    • 827 Words
    • 4 Pages

    1. 2. 3. 4. 5. Solver y programación lineal El modelo Optimización Informes en excel Ejercicios…

    • 827 Words
    • 4 Pages
    Good Essays
  • Satisfactory Essays

    mba projects

    • 329 Words
    • 3 Pages

    Q 2. What is storing how they are maintain explain the various measure of stores?…

    • 329 Words
    • 3 Pages
    Satisfactory Essays