Scribd
Upload
7 views

Integer Programming

The document presents two integer programming problems with their respective formulations and solutions. The first problem maximizes an objective function with a value of 26, while the second problem minimizes an objective function with a value of -7. Both problems have been solved optimally with no infeasibilities.

Uploaded by

Raghav Joseph
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
7 views

Integer Programming

The document presents two integer programming problems with their respective formulations and solutions. The first problem maximizes an objective function with a value of 26, while the second problem minimizes an objective function with a value of -7. Both problems have been solved optimally with no infeasibilities.

Uploaded by

Raghav Joseph
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/ 2

(i) Converting to Integer programming problem.

Max = 4*x1 +6*x2+2*x3;


4*x1-4*x2<5;
-x1+6*x2<5;
-x1+x2+x3<5;
@gin (x1);
@gin (x2);
@gin (x3);

Global optimal solution found.


Objective value: 26.00000
Objective bound: 28.00000
Infeasibilities: 0.000000
Extended solver steps: 0
Total solver iterations: 3
Elapsed runtime seconds: 0.06

Model Class: PILP

Total variables: 3
Nonlinear variables: 0
Integer variables: 3

Total constraints: 4
Nonlinear constraints: 0

Total nonzeros: 10
Nonlinear nonzeros: 0

Variable Value Reduced Cost


X1 2.000000 -4.000000
X2 1.000000 -6.000000
X3 6.000000 -2.000000

Row Slack or Surplus Dual Price


1 26.00000 1.000000
2 1.000000 0.000000
3 1.000000 0.000000
4 0.000000 0.000000
(b) Solve the following IPP
Min = -4*x1-3*x2-x3+2*x4;
4*x1+2*x2+x3+x4<5;
-3*x1-x2-2*x3-x4>-4;
@gin (x1);
@gin (x2);
@gin (x3);
@gin (x4);

Global optimal solution found.


Objective value: -7.000000
Objective bound: -7.000000
Infeasibilities: 0.000000
Extended solver steps: 0
Total solver iterations: 0
Elapsed runtime seconds: 0.03

Model Class: PILP

Total variables: 4
Nonlinear variables: 0
Integer variables: 4

Total constraints: 3
Nonlinear constraints: 0

Total nonzeros: 12
Nonlinear nonzeros: 0
Variable Value Reduced Cost
X1 0.000000 -4.000000
X2 2.000000 -3.000000
X3 1.000000 -1.000000
X4 0.000000 2.000000

Row Slack or Surplus Dual Price


1 -7.000000 -1.000000
2 0.000000 0.000000
3 0.000000 0.000000

SIDDHARTH KAULAGI
1BM22IM052
10/03/2025

You might also like