Scribd
Upload
933 views7 pages

Goal 4

This document presents a goal programming model to optimize production of two products made on two sequential machines. The production quota for each product and the machining times on each machine are given. The objective is to minimize overtime while meeting production quotas. An optimal solution is found using a two-phase linear programming approach, where artificial variables are introduced in Phase I to convert inequality constraints to equalities before solving the overall problem in Phase II to determine the minimum overtime needed.

Uploaded by

Nirmit
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
933 views7 pages

Goal 4

This document presents a goal programming model to optimize production of two products made on two sequential machines. The production quota for each product and the machining times on each machine are given. The objective is to minimize overtime while meeting production quotas. An optimal solution is found using a two-phase linear programming approach, where artificial variables are introduced in Phase I to convert inequality constraints to equalities before solving the overall problem in Phase II to determine the minimum overtime needed.

Uploaded by

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

Problem 7 Problem Set 8.

1A Page 351
Two products are manufactured on two sequential
machines. The following table gives the machining
times in minutes per unit for the two products:
Machining Time in min
Machine Product 1 Product2
1 5 3
2 6 2
The daily production quota for the two products are 80
and 60 units, respectively. Each machine runs 8 hours
a day. Overtime though not desirable may be used if
necessary to meet the production quota. Formulate the
problem as a goal programming model.
Let x1 be the number of units of product1 and
x2 be the number of units of product2 produced
daily.
We thus have the following four goals:

Goal1: x1  80 (Production quota of product 1)


Goal2: x2  60 (Production quota of product 2)
Goal3: 5x1  3x2  480 (Machining time on M/c 1)
Goal4: 6x1  2x2  480 (Machining time on M/c 2)
We convert these inequalities into equalities by
adding slack/surplus variables. Thus our problem
becomes:

Goal1: Minimize s 1

Goal2: Minimize s 2

Goal3: Minimize s 3
Goal4: Minimize s4
 
Subject to x1  s  s  80
1 1
 
x2  s  s  60
2 2
 
5 x1  3x2  s3  s3  480 All variables
 
6 x1  2 x2  s4  s4  480 non-negative.
Problem 7 Problem Set 8.2A Page 354

In problem 7, set 8.1A, suppose that the production


quota for the two products needs to be met, using
overtime if necessary. Find a solution to the problem,
and specify the amount of overtime, if any, needed to
meet the production quota.

Solution: Since the production quota needs to be met,


the problem becomes:
Goal: Minimize overtime
Subject to the constraint: Prod Quota needs to be met.
In symbols: we have to solve the LPP
 
Minimize z s s 3 4

Subject to x1  80
x2  60
 
5 x1  3x2  s3  s3  480
 
6 x1  2 x2  s4  s4  480
Now we solve this by the usual simplex method.
We have to use artificial variable technique as the
first 2 constraints are  type.
Thus we have to solve the LPP
 
Minimize z s s3 4

Subject to x1  R1  s1  80
x2  R2  s2  60
 
5 x1  3x2  s  s  480
3 3
 
6 x1  2 x2  s  s  480
4 4

Here R1, R2 are artificial variables; s1, s2 surplus


variables. We solve by two phase method.
Phase I:
Minimize r  R1  R2
Subject to x1  R1  s1  80
x2  R2  s2  60
 
5 x1  3x2  s  s  480
3 3
 
6 x1  2 x2  s  s  480
4 4

You might also like