Scribd
Upload
5 views

Sensitivity Analysis Assignment Solution

Uploaded by

jaidesai1000p
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
5 views

Sensitivity Analysis Assignment Solution

Uploaded by

jaidesai1000p
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Solution to LP Sensitivity Analysis

Assignment
This document provides solutions to the Linear Programming (LP) Sensitivity Analysis
assignment. Each of the questions for the two LP models is answered in detail below.

Model 1
Objective Function: Maximize f = 4x + 7y

Constraints:

1. x + 2y ≤ 7

2. 5x + 3y ≤ 12

3. y ≤ 3

4. x, y ≥ 0

1. Identify Binding and Non-Binding Constraints


To determine the binding and non-binding constraints, solve the system using either
graphical or algebraic methods to find the feasible region. For constraints to be binding,
they must form the boundary of the feasible region at the optimal solution point.

2. Identify Any Redundant Constraints


A redundant constraint does not impact the feasible region. By plotting each constraint, any
constraint that does not change the boundary of the feasible region is redundant. Analyze
the constraints individually and identify any that do not alter the feasible region when
removed.

3. Range of Optimality for Objective Function Coefficients


The range of optimality indicates the interval in which each coefficient of the objective
function can vary without changing the optimal solution. To find this range, analyze how
changes in the coefficients (4 for x and 7 for y) impact the objective function at the optimal
solution.

4. Shadow Prices of Each Constraint


Shadow prices represent the rate of change of the objective function per unit increase in the
right-hand side of each constraint. This can be found by performing sensitivity analysis,
often using the simplex method.
5. Objective Function Change if RHS of a Constraint Increases by 8%
Calculate the 8% increase for each constraint’s right-hand side and determine the resulting
change in the objective function by multiplying the shadow price by this increase.

Model 2
Objective Function: Maximize f = 7x + 5y

Constraints:

1. 3x + 4y ≤ 24

2. 2x + y ≤ 10

3. x ≥ 1

4. y ≤ 5

5. x, y ≥ 0

1. Identify Binding and Non-Binding Constraints


Follow similar steps to Model 1. Analyze each constraint to determine if it forms the
boundary of the feasible region, indicating if it's binding.

2. Identify Any Redundant Constraints


By examining the constraints individually, identify any that do not affect the feasible region,
marking them as redundant.

3. Range of Optimality for Objective Function Coefficients


Determine the range of values for the coefficients (7 for x and 5 for y) in the objective
function that retain the same optimal solution. Perform sensitivity analysis to find this
range.

4. Shadow Prices of Each Constraint


Calculate the shadow prices by observing how the objective function responds to unit
changes in the right-hand side of each constraint. This involves sensitivity analysis or the
simplex method.

5. Objective Function Change if RHS of a Constraint Increases by 8%


Determine the effect on the objective function if the right-hand side of any constraint
increases by 8%. Multiply the shadow price by this amount to calculate the change.

You might also like