MEPM 531 Integer Linear Programming Assignment Help, Assessment Help

Avail Quality-Based And Cost-Effective MEPM 531 Integer Linear Programming Assignment Help To Secure A++ With Ease!

Home Course
Previous << || >> Next

GET ASSURED A++ GRADE IN EACH MEPM 531 INTEGER LINEAR PROGRAMMING ASSIGNMENT ORDER - ORDER FOR ORIGINALLY WRITTEN SOLUTIONS!

MEPM 531 Operation Research Assignment - Integer Linear Programming, American University of Ras Al Khaimah, UAE

Q1. Solve the following integer linear programming problem by using:

a) Branch and Bound Method

Problem is: Max Z = 3x1 + 4x2

Subject to 2x1+ x2 ≤ 6

2x1 + 3x2 ≤ 9

X1, X2 ≥ 0, and integers

Solution in 4 parts:

Part 1: To draw constraint 2x1+ x2 ≤ 6 → (1)

2x1+ x2 ≤ 6

Treat it as 2x1+ x2 = 6

When x1 = 0 then x2 =?

2(0) + x2 = 6

x2 = 6

When x2 = 0 then x1 =?

2x1 + 0 = 6

x1 = 6/2 = 3

x1	0	3
x2	6	0

Part 2: To draw constraint 2x1+ 3x2 ≤ 9 → (2)

2x1 + 3x2 ≤ 9

Treat it as 2x1 + 3x2 = 9

When x1 = 0 then x2 = ?

2(0) + 3 x2 = 9

3 x2 = 9

x2 = 9/3 = 3

When x2 = 0 then x1 =?

2x1 + 3 (0) = 9

2x1 = 9

x2 = 9/2 = 4.5

x1	0	4.5
x2	3	0

NO PLAGIARISM POLICY - ORDER NEW MEPM 531 INTEGER LINEAR PROGRAMMING ASSIGNMENT & GET WELL WRITTEN SOLUTIONS DOCUMENTS WITH FREE TURNTIN REPORT!

Part 3: To draw constraint >= 0 → (3)

Treat it as = 0

Equation is not possible.

Part 4: To draw constraint >= 0 → (4)

Treat it as = 0

Equation is not possible.

Operation Research Assignment figure.jpg

The value of the objective function at each of these extreme points is as follow:

Extreme Point Coordinates (x1, x2)	Line through Extreme Point	Objective function value Z = 3x1+ 4x2
O(0,0)	5→ x1 >= 0 6→ x2 >= 0	3(0) + 4(0) = 0
A(3, 0)	1→ 2 x1 + x2 <= 6 6→ x2 >= 0	3(3) + 4(0) = 9
B(9/4, 3/2)	1 → 2 x1 + x2 <= 6 2 → 2 x1 + 3x2 <= 9	3(9/4) + 4(3/2) = 51/4
C(0,3)	2 → 2 x1 + 3x2 <= 9 5 → x1 >= 0	3(0) + 4(3) = 12

The maximum value of the extreme function Z = 51/4 occurs at the extreme point (9/4, 3/2). Hence, the optional solution to the given LP problem is: x1 = 94, x2 =32 and max Z = 51/4.

b) Fractional Cut Method

Problem is:

Max Z = 3x1+ 4x2

Subject to 2x1+ x2 ≤ 6

2x1+ 3x2 ≤ 9

X1, X2 ≥ 0, and integers

Standard form

Z = 3x1+ 4x2 + 0S1 + 0S2

S. t.

2x1+ x2 + S₁ = 6

2x1+ 3x2 + S₂ = 9

X1, X2, S1, S2 >= 0

IBFS

S1 = 6 and S2 = 9

C_j (3 4 0 0)

C_B	Y_B	X_B	Y₁*	Y₂	Y₃	Y₄
0	Y₃	6	2	2	1	0
0	Y₄	9	2	3	0	1

C_B X Y₁ C_B X Y₂ + C_B X Y₃

Z_j 0X2 = 0, 0 X 2 + 0X3 = 0; 0 0

0 0 0 0

Net Evaluation Z_j - C_j -3 -4 0 0

Net Evaluation not >= 0

Most negative -4, arbitrary we select Y₁ enters basis.

Min {X_B/Y_1j} = min {6/2, 9/2} 6/2 Y₃ Leave basis

C_j (3 4 0 0)

C_B	Y_B	X_B	Y₁*	Y₂	Y₃	Y₄
1	Y₁	6/6 = 1	2	2	1	0
0	Y₄	9	2	3	0	1

C_B X Y₁ C_B X Y₂ + C_B X Y₃

Z_j 0X2 = 0, 0 X 2 + 0X3 = 0; 0 0

0 0 0 0

Net Evaluation Z_j - C_j -3 -4 0 0

Net Evaluation not >= 0

Most negative -4, arbitrary we select Y₁ enters basis.

Min {X_B / Y_1j} = min {6/2, 9/2} 6/2 Y₃ Leave basis

C_B	Y_B	X_B	Y₁*	Y₂	Y₃	Y₄
1	Y₁	6/6 = 1	2/2 = 1	2/2 = 1	½	0
0	Y₄	9/3 = 3	2/3	3/3 = 3	0/3 = 0	1/3

C_B X Y₁ C_B X Y₂ + CB X Y₃

Z_j 0X2 = 0, 0 X 2 + 0X3 = 0; 0 0

0 0 0 0

Net Evaluation Z_j - C_j 1 3/2 0 0

Net Evaluation not >= 0

Most negative -4, arbitrary we select Y₁ enters basis.

Min {X_B/Y_1j} = min {1, 3/2} 6/2 Y₄ Leave basis.

ENDLESS SUPPORT IN MEPM 531 INTEGER LINEAR PROGRAMMING ASSIGNMENTS WRITING SERVICES - YOU GET REVISED OR MODIFIED WORK TILL YOU ARE SATISFIED WITH OUR MEPM 531 INTEGER LINEAR PROGRAMMING ASSIGNMENT HELP SERVICES!

Q2. Solve the following integer linear problem by:

a) Branch and Bound Method

Max Z = 4x1 + 6x2+ 2x3

s.t. 4x1 - 4x2 ≤ 5

-x1 + 6x2 ≤ 5

-x1 + x2 + x3 ≤ 5

x1, x2, x3 ≥ 0 and integers

Part 1: To draw constraint 4x1 - 4x2 ≤ 5 → (1)

4x1 - 4x2 ≤ 5

Treat it as 4x1 - 4x2 = 5

When x1 = 0 then x2 =?

4(0) - 4x2 = 5

- 4x2 = 5

x2 = -5/4 = -1.25

When x2 = 0 then x1 =?

4x1 - 4(0) = 5

4x1 = 5

x1 = 5/4 = 1.25

x1	0	5/4
x2	-5/4	0

Part 2: To draw constraint -x1+ 6x2 ≤ 5 → (2)

-x1 + 6x2 ≤ 5

Treat it as -x1 + 6x2 = 5

When x1 = 0 then x2 =?

-1(0) + 6x2 = 5

6x2 = 5

x2 = 5/6

When x2 = 0 then x1 = ?

-x1 + 6(0) = 5

-x1 = 5

x1 = -5

x1	0	5/6
x2	-5/6	0

HELPING STUDENTS TO WRITE QUALITY MEPM 531 INTEGER LINEAR PROGRAMMING ASSIGNMENT AT LOW COST!

Part 3: To draw constraint -x1+ x2+ x3 ≤ 5 → (3)

-x1+ x2+ x3 ≤ 5

Treat it as -x1+ x2+ x3 = 5

When x1 = 0 then x2 = -4/5 from equation (1)

Then -x1+ x2+ x3 = 5

-1(0) + -4/5 + x3 = 5

x3 = 5 + 4/5 = 29/5

When x2 = 0 then x1 = 5/4 from equation (1)

-x1+ x2+ x3 = 5

-(5/4) + 1(0) + x3 = 5

-(5/4) + x3 = 5

x3 = 5 + 5/4 = 25/4

When x1 = 0 then x2 = 5/6 from equation (2)

Then -1 (0)+ 5/6 + x3 = 5

5/6 + x3 = 5

x3 = 5 - 5/6 = 5

When x2 = 0 then x1 = 5/6 from equation (2)

-5/6 + 1(0) + + x3 = 5

-(5/6) + x3 = 5

x3 = 5 -(5/6) = 25/6

x1 = 0, x2 = -4/5 then	x3	29/5
x2 = 0 , x1 =5/4 then	x3	25/4
x1 = 0, x2 = 5/6 then	x3	5
x2 = 0 x1 = 5/6	x3	25/6

GET READYMADE MEPM 531 INTEGER LINEAR PROGRAMMING ASSIGNMENT SOLUTIONS - 100% PLAGIARISM FREE WORK DOCUMENT AT NOMINAL CHARGES!

b) Fractional Cut Method

Max Z = 4x1+ 6x2 + 2x3

s.t. 4x1 - 4x2 ≤ 5

-x1 + 6x2 ≤ 5

-x1 + x2+ x3 ≤ 5

x1, x2, x3 ≥ 0 and integers

Standard form

Z = 4x1 + 6x2 + 2x3

s.t. 4x1- 4x2 ≤ 5

-x1 + 6x2 ≤ 5

-x1 + x2+ x3 ≤ 5

x1, x2, x3 ≥ 0 and integers

IBFS

S1 = 5 and S2 = 5

C_j (4 6 0 0)

C_B	Y_B	X_B	Y₁*	Y₂	Y₃	Y₄
0	Y₃	5	4	-2	2	0
0	Y₄	5	3	3	0	1

C_B X Y₁ C_B X Y₂ + C_B X Y₃

Z_j 0X2 = 0, 0 X 2 + 0X3 = 0; 0 0

0 0 0 0

Net Evaluation Z_j - C_j -8 -7 0 0

Net Evaluation not >= 0

Most negative -4, arbitrary we select Y₁ enters basis.

Min {X_B / Y_1j} = min {6/2, 9/2} 6/2 Y₃ Leave basis

C_j (3 4 0 0)

C_B	Y_B	X_B	Y₁*	Y₂	Y₃	Y₄
1	Y₁	6/7	2	2	1	0
0	Y₄	8/7	2	3	0	1

C_B X Y₁ C_B X Y₂ + C_B X Y₃

Z_j 0X2 = 0, 0 X 2 + 0X3 = 0; 0 0

0 0 0 0

Net Evaluation Z_j - C_j -3 -4 0 0

Net Evaluation not >= 0

Most negative -4, arbitrary we select Y₁ enters basis.

Min {X_B / Y_1j} = min {5/2, 3/2} 5/2 Y₃ Leave basis

C_B	Y_B	X_B	Y₁*	Y₂	Y₃	Y₄
1	Y₁	6/3 = 3	2/2 = 1	2/2 = 1	1/2	0
0	Y₄	9/3 = 3	2/3	3/3 = 3	0/3 = 0	1/3

C_B X Y₁ C_B X Y₂ + C_B X Y₃

Z_j 0X2 = 0, 0 X 2 + 0X3 = 0; 0 0

0 0 0 0

Net Evaluation Z_j - C_j 1 3/2 0 0

Net Evaluation not >= 0

Most negative -4, arbitrary we select Y₁ enters basis.

Min {X_B / Y_1j} = min {7, 5/2} 5/2 Y₄ Leave basis.

MOST RELIABLE AND TRUSTWORTHY MEPM 531 INTEGER LINEAR PROGRAMMING ASSIGNMENT HELP & HOMEWORK WRITING SERVICES AT YOUR DOORSTEPS!

3) Solve the following integer linear problem by:

a) Branch and Bound Method

Max Z = 3x1 + x2 + 3x3

s. t. - x1 + 2x2 + x3 ≤ 4

4x2 - 3x3 ≤ 2

x1 - 3x2 + 2x3 ≤ 3

x1, x2, x3 ≥ 0 and integers

Solution: To apply branch and bound method, the three constraints to be added to LP model.

x1 <= 1

x2 <= 1

x3 <= 1

Solution Steps by Big M method:

Max Z = 3x1 + x2 + 3x3

s. t. - x1 + 2x2 + x3 ≤ 4

4x2 - 3x3 ≤ 2

x1 - 3x2 + 2x3 ≤ 3

x1, x2, x3 ≥ 0

Solution is:

Max Z A = 7 (x1= 1, x2 = 1, x3 = 1)

and ZL = 7 (x1= 1, x2 = 1, x3 = 1) obtained by the rounded off solutions value.

This problem has integer solution, so no further branching is required.

The branch and bound diagram.

A

x1= 1, x2 = 1, x3 = 1

ZA = 7

ZL = 7

Solution steps by Big M method.

The 0-1 Integer Programming problem algorithm thus terminated and the optimal integer solution is: ZA = 7 and x1= 1, x2 = 1, x3 = 1

SAVE DISTINCTION MARKS IN EACH MEPM 531 INTEGER LINEAR PROGRAMMING ASSIGNMENT WHICH IS WRITTEN BY OUR PROFESSIONAL WRITER!

b) Fractional Cut Method

Standard form

Max Z = 3x1 + x2 + 3x3

s. t. - x1 + 2x2 + x3 ≤ 4

4x2 - 3x3 ≤ 2

x1 - 3x2 + 2x3 ≤ 3

x1, x2, x3 ≥ 0 and integers

IBFS

S1 = 0 and S2 = 3

C_j (4 6 0 0)

C_B	Y_B	X_B	Y₁*	Y₂	Y₃	Y₄
0	Y₃	0	2	4	2	0
0	Y₄	3	1	3	3	1

C_B X Y₁ C_B X Y₂ + C_B X Y₃

Z_j 0X2 = 0, 0 X 2 + 0X3 = 0; 0 0

0 0 0 0

Net Evaluation Z_j - C_j 10 13 0 0

Net Evaluation not >= 0

Most negative -4, arbitrary we select Y₁ enters basis.

Min {X_B / Y_1j} = min {1/2, 4/2} 1/2 Y₃ Leave basis

C_j (3 4 0 0)

C_B	Y_B	X_B	Y₁*	Y₂	Y₃	Y₄
1	Y₁	3/2	3	2	1	0
0	Y₄	6/3	5	3	0	1

C_B X Y₁ C_B X Y₂ + C_B X Y₃

Z_j 0X2 = 0, 0 X 2 + 0X3 = 0; 0 0

0 0 0 0

Net Evaluation Z_j - C_j -3 -4 0 0

Net Evaluation not >= 0

Most negative -4, arbitrary we select Y₁ enters basis.

Min {XB / Y_1j} = min {5/2, 3/2} 5/2 Y₃ Leave basis

C_B	Y_B	X_B	Y₁*	Y₂	Y₃	Y₄
1	Y₁	6/3 = 3	2/2 = 1	2/2 = 1	1/2	0
0	Y₄	9/3 = 3	2/3	3/3 = 3	0/3 = 0	1/3

C_B X Y₁ C_B X Y₂ + C_B X Y₃

Z_j 0X2 = 0, 0 X 2 + 0X3 = 0; 0 0

0 0 0 0

Net Evaluation Z_j - C_j 1 3/2 0 0

Net Evaluation not >= 0

Most negative -4, arbitrary we select Y₁ enters basis.

Min {X_B / Y_1j} = min {8, 3/5} 3/5 Y₄ Leave basis.

NEVER MISS YOUR CHANCE TO EXCEL IN MEPM 531 INTEGER LINEAR PROGRAMMING ASSIGNMENT! AVAIL AFFORDABLE AND RELIABLE MEPM 531 INTEGER LINEAR PROGRAMMING ASSIGNMENTS HELP SERVICES OF EXPERTSMINDS.COM!

Avail the best American University of Ras Al Khaimah, UAE Assignment Help for below mentioned units and courses:-

MEPM 519 Field Application Project Assignment Help
MEPM 521 Project Cost Accounting and Finance Assignment Help
MEPM 523 Direct Research Assignment Help
MEPM 532 Engineering Management Assignment Help
MEPM 541 Organization Behavior and Project Team Management Assignment Help
MEPM 543 Risk Management for Project Managers Assignment Help
MEPM 513 Project Implementation and Performance Assignment Help
MEPM 514 Global Projects Management Assignment Help
MEPM 516 Project Quality Management Assignment Help
MEPM 522 Financial Analysis and Decision Making Assignment Help
MEPM 533 Information Systems for Project Management Assignment Help
MEPM 542 Supply Chain Management for Project Managers Assignment Help

Tag This :- MEPM 531 Integer Linear Programming Assignment Help, EM19854REM0704LP

International Diploma In Governance, Risk And Compliance Assignment Help

international diploma in governance, risk and compliance assignment help - Explain, as if to a new member of staff who has no previous compliance or regulatory.

Statistical Analysis Project Assignment Help

statistical analysis project assignment help - Southern Cross University, Australia. Part A - Preliminary Analysis of Sample Data. Construct frequency histogram

Creativity and Innovation Assignment Help

creativity and innovation assignment help - develop skills in Deliberate Creative Thinking techniques by applying them to a real life challenge

Employee Engagement and Organizational Effectiveness Assignment Help

employee engagement and organizational effectiveness assignment help- There is a vivid discussion upon organisational effectiveness & employee engagement.

ICT Ethical Issue Assignment Help

ict ethical issue assignment help - The main ethical dilemma involved in this case is studied in this paper. The e ethical dilemma, considering the different

Our Impact on Environment Assignment Help

our impact on environment assignment help - The study of new regulations in the international level relating to the environment have been analysed.

BAFN200: Principles of Finance Assignment Help

bafn200: principles of finance assignment help - this assignment contains solution in regard to the effect on national australian bank by royal commission.

Excel in your Course

Experts are helping students not just improving grades but also to provide better learning of subject concepts and its problem statements. They are providing you world class assistance which may help you to excel in course or assignments.

Avail Quality-Based And Cost-Effective MEPM 531 Integer Linear Programming Assignment Help To Secure A++ With Ease!

Assignment Samples

Excel in your Course

Leave a Comment [MEPM 531 Integer Linear Programming Assignment Help, EM19854REM0704LP]

Featured Services

Popular Subjects Covered