Scribd
Upload
34 views6 pages

"Mathematical Programming" Is Connected With The Fact That The Goal of Solving

De Guzman, John Rey M.

Uploaded by

Kristel Balila
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
34 views6 pages

"Mathematical Programming" Is Connected With The Fact That The Goal of Solving

De Guzman, John Rey M.

Uploaded by

Kristel Balila
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/ 6

BASIC INTEGER PROGRAMMING

 Integer programming is a branch of mathematical programming or optimization,


which involves creating equation in order to solve problems. The term
“mathematical programming” is connected with the fact that the goal of solving
various problems is choosing programs of action.

 An integer programming model is one where one or more of the decision


variables has to take on a integer value in the final solution.

 Solving an integer programming problem is much more difficult than solving LP


problem.

 The mathematical model for integer programming is the linear programming


model with the one additional restriction that the variables must have integer
values.

Types of Integer Programming Problems

 PURE-INTEGER PROBLEMS
-require that all decision variables have integer solutions.

 MIXED-INTEGER PROBLEMS
-require some, but not all of the decision variables to have integer values in
the final solution, whereas others need not have integer values.

 0-1 INTEGER PROBLEMS


-require integer variables to have value of 0 or 1, such as situations in which
decision variable are of the yes-no type.

Uses of Integer Programming

Integer programming expresses the optimization of a linear function subject to a


set of linear constraints over integer variables.
The statements presented in Linear Programming: a production planning example
are all linear programming models.

Importance of Integer Programming

The importance of integer programming stems from the fact that it can be used to the
model a vast array of problems arising from the practical ones (scheduling, allocation
of resources, etc.) to questions in set theory or number theory.
TRANSPORTATION MODEL

 deals with a special class of linear programming problem in which the objective
is to transport a homogeneous commodity from various origins or factories to
different destinations or markets at a total minimum cost.

Terminologies Used in Transportation Model

 Destinations - a point of demand in transportation problem.


 Origin - the source or supply location in transportation.
 Unused Squares - squares which represents routes where no quantity is
shipped.
 Stone Squares - used squares in transportation problem.
 Opportunity Cost - cost of the opportunities that are sacrificed in order to
take a certain action.

Aim of Transportation Model


 “To find out optimum transportation schedule keeping in mind cost of
transportation to be minimized.”

Applications of Transportation Model:

1. It is used to compute transportation routes in such a way as to minimize


transportation cost for finding out locations of warehouses.
2. It is used to find out locations of transportation corporation depots where
insignificant total cost difference may not matter.
3. Minimize shipping cost.
4. Determine low cost location.
5. Find minimum cost production schedule.

Characteristics of Transportation Model

1. A product is to be transported from a number of sources to a number of destinations


at the minimum possible cost.
2. Each source is able to supply a fixed number of units of the product, and each
destinations has a fixed demand for the product.
3. The linear programming model has contains for supply at each source and demand
at each destination.
4. All constraints are equalities in a balanced.
5. Constraints contain inequalities in unbalanced models where supply is not equal to
demand.
Two(2) Types of Transportation Problem:

1. Balanced Transportation Model


-where the total supply EQUAL the total demand.

Total Supply = Total Demand

2. Unbalanced Transportation Model


-where the total supply is NOT EQUAL to the total of the demand.

Total Supply ≠ Total Demand

Two(2) Phases of Solution of Transportation Problem:

1. PHASE I: Initial Basic Feasible Solution


1.1. North-West Corner Rule (NWCR) Method
 is a procedure for obtaining an initial feasible solution to a transportation
problem that starts with allocating units to the upper left-hand corner of
any transportation problem.
 the most systematic and easiest method for obtaining the initial feasible
basic solution.

1.2. Least Cost Method (AKA Minimum Cost method or Greedy Method)
 is a systematized procedure used to find an initial feasible solution to a
transportation problem.
 it is easy to use and provides good (but not original solution).

1.3. Vogel’s Approximation Method (VAM)


 an algorithm that finds an initial feasible solution to a transportation
problem by considering the “penalty cost” of not using the cheapest
available rate.

2. PHASE II: Optimal Basic Solution


2.1. Stepping Stone Method
 a procedure for determining if a solution to transportation problem is
optimal that involves tracing paths from each unused square through
stone.

2.2. Modified Distribution Method (MODI)


 A procedure for determining per unit cost change associated with
assigning flow to an unused square in the transportation problem.
ASSIGNMENT MODEL

The assignment model/method is a way of allocating organizational resources in


which each resources in which resource is assigned to a particular task. The resource
could be monetary, personnel, or technological.

The assignment method is used to determine what resources are assigned to


which department, machine, or center of operation in the production process. The goal
is to assign resources in such a way to enhance production efficiency, control, cost,
and maximize profits.

Types of Assignment Problems

i. BALANCED ASSIGNMENT - an assignment is called balanced assignment


problem if the number of persons (factors) is same as the number of jobs.

ii. UNBALANCED ASSIGNMENT - an assignment is called unbalanced assignment


problem if the number of persons (factors) is not the same as the number of jobs.

The assignment method has various applications in maximizing resources, including:

 Allocating the proper number of employees to a machine or task.


 Allocating a machine or a manufacturing plant and the number of jobs that a
given machine or factory can produce.
 Assigning a number of salesperson to a given territory or territories.
 Assigning new computers, laptops, and other expensive high-tech devices to
the areas that need them the most while lower priority departments would get
the older models.

Companies can make budgeting decisions using the assignment model since it can
help determine the amount of capital or money needed for each area of the company.
Allocating the money or resources can be done by analyzing the past performance of
an employee, project, or department to determine the most efficient approach.
REFERENCES:

https://www.investopedia.com/terms/z/zero-one-integer-programming.asp

https://www.springerprofessional.de/integer-programming-models/2262422

https://www.slideshare.net/mobile/hakeemrehman/integer-programming-68158750

https://youtu.be/DwQZBvEA7Xo

https://www.investopedia.com/terms/7/assignment-method.asp

https://www.slideshare.net/mobile/Dragonfrend/assignment-model-57676442
GROUP 3:

Leader:
Lung-ayan, Rochelle B.

Members:
Amigo, Aaron Patrick S.
Bernos, Amie Rose D.
Bulan, Angelo B.
Cadang, Krizza Mae P.
Mejos, Jerome Jacinto T.
Rivera, Shella Mae D.
Wao, Jenny Mae T.

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