Scribd
Upload
27 views2 pages

Assignment A242

The document outlines an individual assignment for the course SMG3023 Optimization and Operational Research, requiring students to answer several linear programming (LP) problems and analyze optimal solutions. It includes tasks such as formulating LP models, estimating ranges for optimal objective values, and checking the feasibility of basic solutions. The assignment must be submitted by 5pm on June 29, 2025.

Uploaded by

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

Assignment A242

The document outlines an individual assignment for the course SMG3023 Optimization and Operational Research, requiring students to answer several linear programming (LP) problems and analyze optimal solutions. It includes tasks such as formulating LP models, estimating ranges for optimal objective values, and checking the feasibility of basic solutions. The assignment must be submitted by 5pm on June 29, 2025.

Uploaded by

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

SMG3023 Optimization and Operational Research

This is an individual assignment.


Answer all question. Please submit your assignment by 5pm 29 June 2025.

1. Consider the following LP:


Minimize 𝑧 = 4𝑥1 + 𝑥2
Subject to
3𝑥1 + 𝑥2 = 30
4𝑥1 + 3𝑥2 ≥ 60
𝑥1 + 2𝑥2 ≤ 40
𝑥1 , 𝑥2 ≥ 0

The starting solution consists of artificial variable 𝑆1̅ and 𝑆2̅ for the first and second constraint and
slack variable 𝑆3 for the third constraint. Using 𝑀 = 100 for the artificial variables, the optimal
tableau is given as:

Basic 𝑥1 𝑥2 𝑥3 𝑆1̅ 𝑆2̅ 𝑆3 Solution


𝑧 0 0 0 -98.6 -100 -0.2 34
𝑥1 1 0 0 0.4 0 -0.2 4
𝑥2 0 1 0 0.2 0 0.6 18
𝑥3 0 0 1 1 -1 1 10

Write the associated dual problem and determine its optimal solution in two ways.

2. Estimate a range for the optimal objective value for the following LPs:

a) Maximize 𝑧 = 𝑥1 + 5𝑥2 + 3𝑥3


Subject to
𝑥1 + 2𝑥2 + 𝑥3 = 30
2𝑥1 − 𝑥2 = 40
𝑥1 , 𝑥2 , 𝑥3 ≥ 0

b) Maximize 𝑧 = 2𝑥1 + 𝑥2
Subject to
𝑥1 − 𝑥2 ≤ 2
2𝑥1 ≤ 8
𝑥1 , 𝑥2 ≥ 0

c) Maximize 𝑧 = 3𝑥1 + 2𝑥2


Subject to
2𝑥1 + 𝑥2 ≤ 3
3𝑥1 + 4𝑥2 ≤ 12
𝑥1 , 𝑥2 ≥ 0

3. Consider the following LP model:

Maximize 𝑧 = 4𝑥1 + 14𝑥2


Subject to
2𝑥1 + 7𝑥2 + 𝑥3 = 21
7𝑥1 + 2𝑥2 + 𝑥4 = 21
𝑥1 , 𝑥2 , 𝑥3 , 𝑥4 ≥ 0
Check the optimality and feasibility of the following basic solutions:
1
0 2
a) Basic variables = (𝑥2 , 𝑥3 ), Inverse = ( 7)
1 −2

7 2
45
− 45
b) Basic variables = (𝑥2 , 𝑥1 ), Inverse = ( 2 7 )
− 45 45

1
0
2
c) Basic variables = (𝑥1 , 𝑥4 ), Inverse = ( 7 )
−2 1

4. Star Electronics manufactures four types of simple cables for a defence contractor. Each cable
must go through four sequential operations: splicing, soldering, sleeving, and inspection. The
following table gives the pertinent data of the situation:
Cable Minutes per unit Unit
Splicing Soldering Sleeving Inspection Revenue
(RM)
SC320 10.5 20.4 3.2 5.0 9.40
SC325 9.3 24.6 2.5 5.0 10.80
SC340 11.6 17.7 3.6 5.0 8.75
SC370 8.2 26.5 5.5 5.0 7.80
Daily 4,800 9,600 4,700 4,500
capacity
(minutes)

The contractor guarantees a minimum production level of 100 units for each of the four cables.
a) Formulate the problem as a linear programming model and determine the optimum
production schedule.
b) Based on the dual prices, do you recommend making increases in the daily capacities of
any of the four operations? Explain.
c) Does the minimum production requirements for the four cables represent an advantage or
a disadvantage for Star Electronics? Provide an explanation based on the dual prices.
d) Can the present unit contribution to revenue as specified by the dual price be guaranteed
if we increase the capacity of soldering by 10%?

5. Consider the following LP:

Maximize 𝑧 = 𝑥1 + 2𝑥2 + 4𝑥3 − 3𝑥4


Subject to
𝑥1 + 𝑥2 + 𝑥3 =4
𝑥1 + 4𝑥2 + 𝑥4 = 8
𝑥1 , 𝑥2 , 𝑥3 , 𝑥4 ≥ 0

Use the dual problem to show that the basic solution (𝑥1 , 𝑥2 ) is not optimal.

You might also like