Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
47 views

Linear Programming Is: (P Ax+by) (C Ax+by)

Linear programming is a technique for determining the optimal allocation of limited resources to maximize or minimize some objective. It involves formulating a mathematical model of a real-world problem with an objective function and constraints, and solving to find the optimal solution. The document provides an example problem demonstrating how to set up and solve a linear programming model to determine the maximum profit from manufacturing two products given limited machine hours and material constraints.

Uploaded by

I really DUNNO
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
47 views

Linear Programming Is: (P Ax+by) (C Ax+by)

Linear programming is a technique for determining the optimal allocation of limited resources to maximize or minimize some objective. It involves formulating a mathematical model of a real-world problem with an objective function and constraints, and solving to find the optimal solution. The document provides an example problem demonstrating how to set up and solve a linear programming model to determine the maximum profit from manufacturing two products given limited machine hours and material constraints.

Uploaded by

I really DUNNO
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Introduction

Linear programming is used for obtaining the most optimal solution for a problem with given
constraints. In linear programming, we formulate our real-life problem into a mathematical
model. It involves an objective function, linear inequalities with subject to constraints.

Many mathematical models designed to solve real world problems in business and economics
involve finding either the maximum or the minimum value of a function, subject to certain
limitations. As a matter of fact, these problems arise in the cases where available to resources
are limited or cannot be fully utilized. In this module, the primary concern is on solving a
particular real-world problem by setting up its corresponding mathematical model. It will be
focus on maximization problems. You identify the parts on how to solve linear programming,
graph maximization problems and give decision rule.

Linear Programming is a method of dealing with decision problems that can be expressed as
constrained linear models. It will help managers to ideally develop a production schedule and an
inventory policy that will satisfy sales demand in the future period at the same time minimize the
total production and inventory costs.

Two Properties of Linear Programming Problems


1. Maximizing ( P=ax+ by)
2. Minimizing (C=ax +by )

3. The function to be optimized in linear programming is called the objective function. This usually
refers to profit maximization or cost minimization. In linear programming problems, constraints are
given by inequalities (called inequality constraints).
4.
5. There are two types of constraints:
6. Structural Constraint is a limit on the availability of resources; it is also referred as explicit
constraint. Non-negativity constraint is the constraint that restricts all the variables to zero
and positive solution; it also referred as implicit constraint. Let’s take the linear
programming model below.

Maximize : P=1200 x +1600 y Objective Function


Explicit Contraints ¿ ⋯ ¿ x ≥ 0 , y ≥ 0 ¿ Implicit Constraints ¿
¿ : ¿
Solving linear programming: Maximization problem.

Example. A firm manufactures 2 products, A and B. Each product is processed by 2 machines,


M 1 and M 2. Each unit of type A requires 1 hour of processing by M 1 and 2 hours in M 2 and
each unit of type B requires 3 hours on M 1 and 1 hour on M 2. The profit on product A is ₱20 per
unit and on product B is ₱30 per unit. If M 1 is available for 200 hours each month and M 2 for
300 hours, how many units of each type can be manufactured in one month in order to
maximize the profits?

Solution:
Step 1. Create a summary table (if necessary).
Let x be the product A and y be the product B. Make a contingency table if necessary.
Product Machine 1 Machine 2 Profit
x → 1x → 2x → 20x
y → 3y → 1y → 30y
Availability 200 hours 300 hours

Step 2. Set-up the functions: (objective, explicit and implicit)


Maximize: P=20 x +30 y
Subject to: x +3 y ≤ 200 hours time in Machine 1
2 x+ y ≤ 300 hours in Machine 2
x, y≥0

Step 3. Solve for feasible vertices algebraically or graphically using the equality
functions above.
a) x +3 y=200 Let x = 0, y = 66.67 (0, 66.67) let y = 0, x = 200 (200, 0)
2 x+ y =300 Let x = 0, y = 300 (0, 300) let y = 0, x = 150 (150,
0)
(Choose the once closest to graphs origin since there are no other explicit
constraints given.)
*selection varies depending on the functions

b) Point of intersection of x +3 y ≤ 200 and 2 x+ y ≤ 300 ,


2 x+ y=300
2 x+ y=300 2 x + y=300 −2 x−6 y=−400
x +3 y=200 −2(x +3 y=200) −5 y=−100
y=20
Solve for x: x +3 y=200 x+ 3 ( 20 )=200 x=200−60 x=140  (140, 20)

Thus, the feasible vertices are (0, 66.67), (150,0) and (140, 20).

(Or use graph to locate the feasible vertices easily, you may use
https://www.desmos.com/calculator )

Step 4: Substitute the feasible vertices to the function to get the maximum
Maximize: P=20 x +30 y
20 ( 0 ) +30 ( 66.67 ) =₱ 2 , 000.10
20 ( 150 ) +30 ( 0 )=₱ 3 , 000.00
20 ( 140 ) +30 ( 20 )=₱ 3 , 400.00
Step 5. Decision
Therefore, there are x = 140 units of product A and y = 20 units of product B.
Maximum profit of P3, 400.00

Assignment:
A local boutique produced two designs of gowns A and B and has the following materials
available: 18 square meters of cotton, and 20 square meters of silk, and 5 square meters of
wool. Design A requires the following: 3 square meters of cotton, 2 square meters of silk and 1
square meter of wool. Design B requires the following: 2 square meters of cotton, 4 square
meters of silk. If the Design A sells for ₱1,200 and Design B for ₱1,600, how many of each
garment should the boutique produce to obtain the maximum amount of money?

You might also like