Scribd
Upload
5 views3 pages

Omodaratan Assignment

Uploaded by

Ifeanyi Okpala
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
5 views3 pages

Omodaratan Assignment

Uploaded by

Ifeanyi Okpala
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

COUSE TITLE: LINEAR PROGRAMMING/OPERATION RESEARCH

COURSE CODE:CSC310

SUMMARY ON OPERATION RESEARCH

Linear Programming (LP) is a mathematical method used to optimize (maximize or minimize) a linear
objective function, subject to linear constraints.

*Key Components

1. Decision Variables: Variables representing choices or unknowns.

2. Objective Function: Linear function to be optimized (e.g., maximize profit, minimize cost).

3. Constraints: Linear equations or inequalities limiting possible solutions.

4. Non-Negativity Constraints: Decision variables cannot be negative.

TYPES OF LINEAR PROGRAMMING

1. Maximization Problem: Maximize the objective function.

2. Minimization Problem: Minimize the objective function.

METHODS OF LINEAR PROGRAMMING

1. Graphical Method: Visual representation of constraints and objective function.

2. Simplex Method: Iterative algorithm for solving LP problems.

3. Dual Simplex Method: Variation of Simplex Method for minimization problems.

APPLICATIONS OF LINEAR PROGRAMMING


1. Resource Allocation

2. Production Planning

3. Transportation Problems

4. Financial Planning

5. Supply Chain Management

BENEFITS OF LINEAR PROGRAMMING

1. Optimal Solution

2. Efficient Resource Utilization

3. Cost Minimization

4. Profit Maximization

5. Informed Decision-Making

SOFTWARE TOOLS

1. Excel Solver

2. MATLAB

3. Python libraries (e.g., PuLP, SciPy)

4. R

5. Linear Programming solvers (e.g., CPLEX, Gurobi)

*Formula:*

Maximize/Minimize: Z = c1x1 + c2x2 + ... + cnxn


Subject to:

a11x1 + a12x2 + ... + a1nxn ≤ b1

a21x1 + a22x2 + ... + a2nxn ≤ b2

...

am1x1 + am2x2 + ... + amnxn ≤ bm

x1, x2, ..., xn ≥ 0

Where:

- Z = objective function

- x1, x2, ..., xn = decision variables

- c1, c2, ..., cn = coefficients

- a11, a12, ..., amn = constraint coefficients

- b1, b2, ..., bm = constraint limits

CONCLUSION

Linear Programming is an optimization model. It is a mathematical technique designed to help


operations managers plan & make decisions necessary to allocate and optimize resources. This video
covers the four essential functions of Linear Programming (Limited Resources, An explicit objective,
Linearity, and Homogeneity). We will discuss the components of a Linear Programming model including
decision variables, the objective function, and constraints. We will conclude with how to formulate and
solve for the model. Content derived from from the Textbook "Operations Management, Sustainability
and Supply Chain" 13th edition by Jay Heizer, Barry Render and Chuck Munson. Module B on Linear
Programming.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy