Scribd Logo
Upload

Welcome to Scribd!

  • Linear Objective Function: Minimize Distance

    Uploaded by

    Fernanda Flores
    12 views1 page
    Linear programming is a method to optimize a linear objective function subject to linear constraints. It involves defining decision variables, an objective function, and constraints to determine the feasible region of possible solutions. The graphic method graphically determines the feasible region for problems with two decision variables, while the simplex method transforms problems into standard form to iteratively find the optimal solution for problems with more variables.

    Original Description:

    Operational Research

    Original Title

    Operational Research

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    Linear programming is a method to optimize a linear objective function subject to linear constraints. It involves defining decision variables, an objective function, and constraints to determine the feasible region of possible solutions. The graphic method graphically determines the feasible region for problems with two decision variables, while the simplex method transforms problems into standard form to iteratively find the optimal solution for problems with more variables.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    12 views1 page

    Linear Objective Function: Minimize Distance

    Uploaded by

    Fernanda Flores
    Linear programming is a method to optimize a linear objective function subject to linear constraints. It involves defining decision variables, an objective function, and constraints to determine the feasible region of possible solutions. The graphic method graphically determines the feasible region for problems with two decision variables, while the simplex method transforms problems into standard form to iteratively find the optimal solution for problems with more variables.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    Linear programming (LP): is a method to achieve the best (optimal) outcome in a problem

    described by linear relationships.

    Linear Objective function: minimize distance

    Z=f(x)

    Linear Constraints: Fuel, delivery times, time

    H(x) = 0
    g(x) < 0

    Graphic method

    Simple and easy. Problem: limited to LP problems with 2 decision variables.

    Define decision variables

    Objective function

    Goal

    Restraints

    Step 1: Graphically determine the feasible region

    Feasible region: set of all feasible solutions of the LP problem. All the points (X, Y) that satisfy the
    constraints of the problem.

    Simplex method

    Standard form: equalities, max, and all positive. So we need to transform it.

    From min o max: change the signs z=-2x1 + 3x2 --- -z=+2x1-3x2

    Inequalities to equalities: Slack and surplus variables.

    X1 – 3x2 + 2x3 + S1 = 3

    -X1 + 2x2 – S2 = 2

    X2, x3, S1, S2 > 0

    You might also like