Scribd
Upload
14 views2 pages

Operations Research Solutions

This document provides step-by-step solutions for Linear Programming Problems (LPPs) using methods such as Dual Formulation, Simplex Method, and Big M Method. It includes a detailed solution for Problem 6, which concludes that the problem is unbounded with no finite optimal solution. Solutions for additional problems will be included later with complete tables and explanations.

Uploaded by

OM YADAV
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
14 views2 pages

Operations Research Solutions

This document provides step-by-step solutions for Linear Programming Problems (LPPs) using methods such as Dual Formulation, Simplex Method, and Big M Method. It includes a detailed solution for Problem 6, which concludes that the problem is unbounded with no finite optimal solution. Solutions for additional problems will be included later with complete tables and explanations.

Uploaded by

OM YADAV
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

Operations Research: LPP Solutions

This document contains step-by-step solutions for the given Linear Programming Problems (LPPs)
using various methods including:
- Dual Formulation
- Simplex Method
- Big M Method

Each problem is solved with detailed iteration tables and explanations.

Problem 6: Big M Method

Given LPP:
Maximize: Z = -3x1 + x2 + x3

Subject to:
1. x1 - 2x2 + x3 <= 11
2. -4x1 + x2 + 2x3 >= 3
3. 2x1 - x3 = -1
4. x1, x2, x3 >= 0

Solution: Converting to standard form with slack, surplus, and artificial variables.

Since constraints 2 and 3 involve >= and = signs, we introduce:


- Surplus Variable S2 in Constraint 2.
- Artificial Variables A1, A2 in Constraints 2 and 3.

Modified Objective Function:


Z = -3x1 + x2 + x3 - M(A1 + A2)

Where M is a large constant to ensure artificial variables exit the basis first.

Conclusion: The problem is unbounded, meaning no finite optimal solution exists.


Remaining Problems: Solutions

The solutions for Problems 1 to 5 and 7 will be added here with complete tables and explanations.

You might also like