Question

anybody familiar with Lingo software?

Answer 1

Somewhat.What do you need to know?

Answer 2

Yes . what kind of thing u need to learn or know.

Answer 3

Sets
F = Set of flights
K = Set of fleet types
C = Set of last-nodes, representing all nodes with aircraft grounded overnight at an airport in the network
M = Number of nodes in the network

Index
i = Flight Index
j = Index for fleet
k = Index for nodes

Parameters
C (i,j) = Cost of assigning fleet type j to flight i
N (j) = Number of available aircraft in fleet type j
S (i,k) = +1 if flight i is an arrival at node k, -1 if flight i is a departure from node k

Decision Variables
X (i,j) = 1 if flight is assigned to fleet-type j, 0 otherwise
G (k,j) = integer decision variable representing number of aircraft of fleet-type on ground at node k

The integer linear programming model is as
Min \[\sum_{j \in K}\sum_{i \in F}c(i,j)*x(i,j)\]
subject to:
\[\sum_{j \in K} x(i,j) = 1 \forall i \in F\]
\[G(k-1,j) + \sum_{i \in F}S(i,k)*x(i,j) = G(k,j) \forall k \in M and \forall j \in K\]
\[\sum_{k \in C} G (k,j) \le N(j) \forall j \in K\]
\[x(i,j) \in \left\{ 0,1 \right\} \forall i \in F and \forall j \in K\]
\[G(k,j)\in \mathbb{Z}^+ \forall k \in M \forall j \in K\]

Answer 4

My problem is in the set C, since that is part of set M, i don't know how to write in lingo so I can write the constraint number 2 and 3

Answer 5

i can't***