In this paper, Lagrange interpolation in Chebyshev-Gauss-Lobatto nodes is used to develop a procedure for finding discrete and continuous approximate solutions of a singular boundary value problem. At first, a continuous time optimization problem related to the original singular boundary value problem is proposed. Then, using the Chebyshev- Gauss-Lobatto nodes, we convert the continuous time op...

the traveling salesman problem (tsp) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. the tsp is probably the most famous and extensively studied problem in the field of combinatorial optimization. because this problem is an np-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...

this research provides an optimization tool for use by supply chain managers in the design and operation of manufacturing- distribution networks under uncertain demand conditions. the problem under consideration consists of determining the supply chain infrastructure; raw material purchases, shipments, and inventories; and finished product production quantities, inventories, and shipments neede...

location-allocation is a combinatorial optimization problem, and is defined as non deterministic polynomial hard (np) hard optimization. therefore, solution of such a problem should be shifted from exact to heuristic or meta heuristic due to the complexity of the problem. locating medical centers and allocating injuries of an earthquake to them has high importance in earthquake disaster managem...

This paper considers the parcel hub scheduling problem (PHSP) with unequal batch size inbound trailers, which is a combinatorial optimization problem commonly found in a parcel consolidation terminal in the parcel delivery industry (PDI). The problem consists of processing a large number of inbound trailers at a much smaller number of unload docks. The parcels in the inbound trailers must be un...

In this paper we consider a fractional optimization problem that minimizes the ratio of two quadratic functions subject to a strictly convex quadratic constraint. First using the extension of Charnes-Cooper transformation, an equivalent homogenized quadratic reformulation of the problem is given. Then we show that under certain assumptions, it can be solved to global optimality using semidefini...