Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
27 views3 pages

University of Electronic Science and Technology of China: School of Management of Economics

This document contains an example linear programming problem from an operations research textbook. It presents an optimization problem to minimize the objective function Z=3x1 + 2x2 subject to three constraints involving x1 and x2. It provides the solution steps of setting each variable to 0 in turn to find the feasible region is between x1=3 and x2=2, giving the minimum value of Z as 13. The document then presents another sample linear programming problem to minimize consultant staffing costs subject to various constraints on full-time and part-time consultant hours.

Uploaded by

cool_stud_wali
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
27 views3 pages

University of Electronic Science and Technology of China: School of Management of Economics

This document contains an example linear programming problem from an operations research textbook. It presents an optimization problem to minimize the objective function Z=3x1 + 2x2 subject to three constraints involving x1 and x2. It provides the solution steps of setting each variable to 0 in turn to find the feasible region is between x1=3 and x2=2, giving the minimum value of Z as 13. The document then presents another sample linear programming problem to minimize consultant staffing costs subject to various constraints on full-time and part-time consultant hours.

Uploaded by

cool_stud_wali
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

University of Electronic Science and

Technology of China

School of Management of Economics

Assignment # 1

Course: Introduction to Operations Research


Chapter: Introduction to Linear Programming

Exercise # 3.1-13
Minimize Z=3x1 + 2x2
Subject to
x1 + 2x2 < 12
2x1 + 3x2 = 12
2x1 + x2 > 8

where
x1 > 0 ,
x2 > 0

Solution:
x1 + 2x2 < 12
Let x1 = 0
Then x2 = 6

2x1 + 3x2 = 12
Let x1 = 0
Then x2 = 4

2x1 + x2 > 8
Let x1 = 0
Then x2 = 8

Let x2 = 0
Then x1 = 12

Let x2 = 0
Then x1 = 6

Let x2 = 0
Then x1 = 4

Let the minimizing


Point be 16
3x1 + 2x2 = 16
Let x1 = 0
Then x2 = 8
Let x2 = 0
Then x1 = 5.3

Let the minimizing


point be 14
3x1 + 2x2 = 14
Let x1 = 0
Then x2 = 7
Let x2 = 0
Then x1 = 4.6

Let the minimizing


point be 13
3x1 + 2x2 = 13
Let x1 = 0
Then x2 = 6.5
Let x2 = 0
Then x1 = 4.3

Z = 3x1 + 2x2
From the diagram x1 = 3 & x2 = 2
Z = 3(3) + 2(2)
=9+4
= 13
Graphical Presentation:

Exercise # 3.4-

10

Solution:
Decisions Variables:
x
1
x
2
x
3
x
4
x

total number of full time consultants working from 8am to noon


total number of full time consultants working from noon to 8pm
total number of full time consultants working from 4pm to midnight
total number of part time consultants working from 8am to noon
total number of part time consultants working from noon to 4pm

5
x
6
x
7

total number of part time consultants working from 4pm to 8pm


total number of part time consultants working from 8pm to midnight

Constraints:

X1
X2
X3
X1
X2
X3
X1
X1

+ Y1 > 4
+ Y2 > 8
+ Y3 > 10
/ Y1 > 2 X1 2Y1 > 0
/ Y2 > 2 X2 2Y2 > 0
/ Y3 > 2 X3 2Y3 > 0
2Y1
> 0, X2 > 0, X3 > 0, Y1 > 0, Y2 > 0, Y3 > 0, Y4 > 0

Objective Function
Minimize Z= (40x8)(X1+X2+X3)+(30x4)(Y1+Y2+Y3+Y4)

You might also like