Scribd
Upload
146 views12 pages

Operational Research BIP Modeling Example

The solver found a solution that minimizes the objective cell to a value of 18. It assigned sequences 1, 5, and 12 as having a value of 1 (representing assigning a crew), with all other sequences having a value of 0. This solution satisfies all constraints while minimizing costs to $18,000 by assigning crews on specific flight sequences for Southwestern Airlines.

Uploaded by

Keven Ngeti
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
146 views12 pages

Operational Research BIP Modeling Example

The solver found a solution that minimizes the objective cell to a value of 18. It assigned sequences 1, 5, and 12 as having a value of 1 (representing assigning a crew), with all other sequences having a value of 0. This solution satisfies all constraints while minimizing costs to $18,000 by assigning crews on specific flight sequences for Southwestern Airlines.

Uploaded by

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

Microsoft Excel 16.

67 Answer Report
Worksheet: [Book1]Sheet1
Report Created: 2022/12/5 00:24:47
Result: Solver found a solution. All constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 457.398 Seconds.
Iterations: 4 Subproblems: 20
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 0.000001, Use Automatic Scaling
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Assume NonNegative

Objective Cell (Min)


Cell Name Original Value Final Value
$M$38 Minimum Cost Solutions (1 or 0) 0 18

Variable Cells
Cell Name Original Value Final Value Integer
$M$23 Solutions (1 or 0) 0 1 Binary
$M$24 Solutions (1 or 0) 0 0 Binary
$M$25 Solutions (1 or 0) 0 0 Binary
$M$26 Solutions (1 or 0) 0 0 Binary
$M$27 Solutions (1 or 0) 0 1 Binary
$M$28 Solutions (1 or 0) 0 0 Binary
$M$29 Solutions (1 or 0) 0 0 Binary
$M$30 Solutions (1 or 0) 0 0 Binary
$M$31 Solutions (1 or 0) 0 0 Binary
$M$32 Solutions (1 or 0) 0 0 Binary
$M$33 Solutions (1 or 0) 0 0 Binary
$M$34 Solutions (1 or 0) 0 1 Binary

Constraints
Cell Name Cell Value Formula Status
$L$41 Constraints 1 $L$41>=1 Binding
$L$42 Constraints 1 $L$42>=1 Binding
$L$43 Constraints 1 $L$43>=1 Binding
$L$44 Constraints 3 $L$44>=1 Not Binding
$L$45 Constraints 2 $L$45>=1 Not Binding
$L$46 Constraints 3 $L$46>=1 Not Binding
$L$47 Constraints 4 $L$47>=1 Not Binding
$L$48 Constraints 4 $L$48>=1 Not Binding
$L$49 Constraints 2 $L$49>=1 Not Binding
$L$50 Constraints 5 $L$50>=1 Not Binding
$L$51 Constraints 2 $L$51>=1 Not Binding
$L$52 Constraints 3 $L$52=3 Binding
$M$23:$M$34=Binary
onNegative

Slack
0
0
0
2
1
2
3
3
1
4
1
0
SL2209006 Keven Ngeti
Sequence of 1 2
Flights
1 1
2 1
3
4 1
5 1
6
7 1
8 1
9
10 1
11 1
12

Sequence Solutions (1 or 0)
1 1
2 0
3 0
4 0
5 1
6 0
7 0
8 0
9 0
10 0
11 0
12 1

Minimum Cost 18

1 >= 1
1 >= 1
1 >= 1
3 >= 1
2 >= 1
3 >= 1
4 >= 1
4 >= 1
2 >= 1
5 >= 1
2 >= 1
3 = 3

By assigning sequences x1, x5


Southwestern Airline
Input Data
Flights

3 4 5 6 7 8 9

2
2
1
2 3 4
3 4 2
1 3
2 3
3 2
1 3 4 5
2 5 3
5 3 2
1 3 4

Decision Variables

Objective

Constraints
uences x1, x5 and x12 a crew, with all other values for xj = 0,
estern Airlines can minimize their costs to $18,000.
10 11 Costs

2
3
2 4
6
7
2 5
4 7
4 8
2 9
4 9
4 8
5 2 9
for xj = 0,
.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy