ANSWER1

The main objective of transportation problem is seeking way for minimizing the cost function. Cost
function means that it is amount of money which spent for logistic part of production to take product
from manufacturers and supply them to final users (other industries), in short to transport products
from supplier to needed point. Moreover, it involves different terms like form of transport (shipping,
airways), amount of weight needed to transport, how many km needed to exceed, path followed and
speed of transport. Moreover, the main point is to transportation of commodities within using less
budget schedule without any rapprochement in demand and supply chain. One of the prolongation of
linear programming is the transportation problem because the transportation costs are calculated like a
linear function to the supply capacity and demand. Main characteristics of transportation are:

a) The capacity of each of the sources- the amount of goods that can be manufactured at each
plant and keeping at each department or inventory and this named like stock and supply point.
b) The amount which demanded at each of the need point and the quantity of products that are
asked for by each of consumers and this is named like destination.
c) The unit cost of shipping productsa goods form point of supplying to point of demand. The
carriage process of one item is the unit cost, and if one item costs X pounds to transfer from A
point to B point then two items will cost till 2X to transport along that route and N items cost
will be N*C pounds

For solving the transportation problem:

Firstly, find an previous solution that need to use whole the stock and fulfill demands in satisfactory
level. Then, formulate the all cost of this solution and there is any way to decrease it by shipping some
of commodities along a route in solution (if it is not feasible then solution is optimal). Next, whether cost
of transportation can be reduced by using a new route, then as a lot of units as probable are separated
to this new route to generate this is another new solution way. Moreover, the new solution is examined
in the similar way as the previous solution to know if it is optimal. But, if this one is not an optimal way,
then any new routes found are involved. Finally, whether there are not another money saving ways are
not feasible, an optimal solution way had been created.

ANSWER2:
Originally, it is very rare process to see supply and demand requirements are equal to each- other
because of variation in production from the manufacturer or supplier to final user or end and variations
in predicting from the customer end. Supply variations may be because of shortage of raw materials,
lack of labor issues, then planning and scheduling are improper with transportation model. Demand
variations may be because of change in preference of consumers, extremely change in price categories
and competitors introduce of new types of products to markets.

These unbalanced problems can be solved in easier way with promoting new dummy destinations and
dummy resources. Whether the total supplying procedure will be more than the total demanding
process, a dummy column with demand will be equal to supply surplus is contributed. If the all demand
is bigger than whole supply, then dummy row with supply balance to demand surplus is rose up. Then,
each of unit transportation costs for dummy destination and dummy source are designated 0 values,
why? Because there is no shipment is really realized in form of a dummy row and dummy column. And
to back from unbalanced problem into balanced transportation problem, we have to contribute a
dummy column with using this formula:
 thus, dummy column is contributed here, with using demand of additional 100
points. Then, we will see that unit cost of transportation of dummy columns are indicated like zero.

ANSWER4:
Waiting line is the common phenomena which almost all people uses in their daily life period, for
instance, banks have customer in lane to get teller’s work service, cars are standing in queues to re-fill,
employees are lining up to enter machine to conduct their responsibilities in order to duty. Then,
management needs to work on formulae that is reducing waiting time and generating more satisfactory
consumers with incurring an reducing some of additional cost. Totally, managing standing in queue
issues are trade off’s condition between cost of time passed in waiting line and cost of additional
machinery. Elements of waiting line system:

Finite and infinite population- there always will be situation of finite and infinite customers. A finite
population of costumers scenario reflects that limited size of consumers visit the service counter and it
adopts that customer once served leave the line, by this way decreasing whole population of
consumers. But model of finite population takes one of the scenario into account where consumers
after getting service will visit counter of service again and this will let to rise up in finite population. An
infinite population says that it looks at a scenario which substractions and contribution of consumers do
not influence all workability of the model.

Service Configuration

There is one of the other aspect of waiting line management is the service configuration. There
are four different sorts of it and they are like bellows:

a) Single Channel, Single Phase (for example, ship yards and car wash)
b) Single Channel, Multi Phase (for example, bank tellers)
c) Multi Channel, Single Phase (for example, separate queue of man and women for single
ticket window)
d) Multi Channel, Multi Phase (for example, laundromat, where choice of several washers
and several dryers)

Queuing System
To solve problems connected to queue management it is essential to get into mind
features of the queue. Some of queue conditions are waiting in line for service in super-
markets or banks, waiting for outcomes from computer and waiting in line for commuter
rail. Common antecedent of waiting queue theory is- there are limited sources that is
given population of consumers and supplementary of a new service line will rise up the
cost aspect to the business. A normal queue system has the following features:
Arrival Process: As the name said, an arrival process seeking different parts of customer
arrival. Customer arrival can in single, batch or bulk, arrival as distribution of time,
arrival in finite population or infinite population.
 Service Mechanism:This searching available sources for customer service, queue
structure
to utility the service and accepted before of service. Primary assumption is that service
time of customers is independent of arrival to the queue.
Queue Characteristics: this looks at selection of customers from the queue for service.
Generally, customer choice is through first come first served method, random or last in
first out. As a outcome, customers leave if the queue is long, customer leave if they have
waited too long or switch to faster serving queue.
Queue discipline:
Order in which customers are served and
First come, first served is most common

ANSWER5:
Advantages:

a) Processing speed:
Increase speed of processing humans and products in different scenarios. In its
most basic form, the purpose of queue management systems is to reduce the traffic in a
queue flow
b) Convenience to the Customers:
To achieve a better quality of service to customers is the main objective of queue
management systems. A queue management system issues a customer reference for each
arriving customer, each reference showing the situation of a respective customer within a
queue, while, getting rid of the need to stand in line while waiting. By permitting the
consumers to save their rights in the queue when they are stand in leisure and managing of
queue system gives a hand to give comfortable and fairness environment for their
customers.
c) Simulations:
Standing in queue theory has flourished according to the appearing of the computer age.
The past hardness of arriving at numerical solution ways for standing queue models are
performing no longer a disadvantage, as mathematicians can run simulations to arrive at
approximate answers.

Disadvantages:
a) Low applicability:
Because, standing in queue models are maintained on the exponential distribution, these
models work through implementing the traits of the exponential distribution. The core
problem lies in that the exponential distribution has a coefficient of variation of one. This fact
precludes the modelling of any process that has a coefficient of variation significantly
different from one. Because of the low likelihood of a random process having a coefficient of
variation of one, standing in queue theory has the disadvantage of low applicability. 
b) Assumptions:
While the assumptions for most applications of standing in queue models are few, the
assumptions that are needed tend to be somewhat irrational. Especially, in regarding to
human queues, standing in queue theory requires assumptions that cannot possibly hold
true in the real world. In general, standing in queue theory presumes that human behaviour
is deterministic factor.

ANSWER6:
Which of consumers are served next are identified by a waiting-line priority rule. A frequently
way is that, this is used priority rule is who come first and then this person will be served in
first place. Priority rule chooses consumers based upon who has been standing in a queue for
the longest time in queue among the other people. Totally, consumers contemplate first-come,
first-served for being the fairest way of servicing for identify rule of priority. Not only it is not
the only priority rule used, but also other rules involved into best customers first, highest-profit
customer comes first, quickest-service requirement needed for him/her for firstly, largest-
service requirement first, emergencies first, and so on. In spite of each priority rule has merit,
it is essential to use the priority rule that best supporter for being the most appreciated
organizational strategy. For instance, a first-come, first-served rule doesn’t make sense in a
hospital emergency room and in fact could being a reason unneeded death accidents. The
priority rule used impacts the performance of the waiting line system. As an example, first-come,
first-served is generally considered fair, yet it is biased against customers demanding short-time
service. When checking out at a store that is using first- come, first-served as a priority rule, a
customer waiting behind another customer with a large number of items waits longer than a
customer waiting behind a second customer with only a few items. Even though, processing is
consequent, the wait times vary because of the preceding customer. Additionally, priority rules
besides first-come, first-served may imply that some customers wait extremely for a long time.
For example, in a busy emergency room, someone not critically sick or injured could wait a
significant period of time.

ANSWER7:
The most common case of queuing problems involves the single-channel waiting line. In this
condition, arrivals form a single line to be serviced by a single station. We accept that the
following conditions exist in this type of system:
1) Arrivals are served on a first-in, first-out (FIFO) basis and every arrival waits to be served,
without considering of the length of the queue.
2) Arrivals are independent of preceding arrivals, but the average number of arrivals (arrival
rate) does not change over time.
3) Arrivals are described by a Poisson probability distribution and come from an infinite (very
large) population.
4) Service times vary from one customer to the next and are independent of one another, but
their average rate is known.
5) Service times occur according to the negative exponential probability distribution.
6) The service rate is faster than the arrival rate

Now let’s take a look for a multiple-channel queuing system in which two or more servers or
channels are available to handle arriving customers. We still assume that customers standing in
queue for service form one single line and then proceed to the first available server.
Multichannel, single-phase waiting lines are found in many banks today: A common line is
formed, and the customer at the head of the line proceeds to the first free teller. The multiple-
channel system assumes that again arrivals follow a Poisson distribution of probability and that
service times are exponentially separated. Service is first come, first-served, and all servers are
assumed to perform at the same rate. As an example of this type of system, consider the customer
service department of the Biggs Department Store. The customer service department of the store has a
waiting room in which chairs are placed along the wall, in effect forming a single waiting line. Customers
come to this area with questions or complaints or to clarify matters regarding credit card bills. The
customers are served by three store representatives, each located in a partitioned stall. Customers are
served on a first-come, first- served basis.

ANSWER8:
An integer programming model is one of the method is used in the final solution many of the
variable must take on an value of integer model. Meanwhile, for solving heavy integer
programming problem, even the most feasible computers can not solve this problem on easy
way. Also solving Linear programming problem is easier than Integer programming.
Generally, Linear programming is be charging for a problem but if it can not be solved over
linear then we have to apply IP problem solver. That is why the LP model is mathematical
form of IP model with only a prohibition that integer values have to be used in variables. There
are three kinds of problem of integer: Pure ILP (asking for whole decision variable has integer
solution, Zero-one integer (demanding integer variable to have 0 and 1’s values, like situations
in that decision variable is of the yes or no type), Mixed ILP (charging not all of decision, just
some of them (decision variable) that have integer value in final solution while other ones need
not have integer value.
Example: a machine is used to produce two interchangeable products. The daily capacity of the
machine can produce at most 20 units of product 1 and 10 units of product 2. Alternatively, the
machine can be adjusted to produce at most 12 units of product 1 and 25 units of product 2 daily.
Market analysis indicates that the max. daily demand for the two products assembled is 35 units,
given that unit profits for the two respective products are 10 and 12$, which of the two machine
settings should be chosen?
a) Define decision variables:
X(1) =production quantity of product 1
X(2) =production quantity of product 2
Y =1 if the first setting is chosen or 0 otherwise

b) Formulate the ILP model to maximize the total profit.