This work aims to provide a representation theorem for consumption in simplex in continuous time by using a weaker axiom of ’Agree with’, a strong axiom of ’Preferential Independence’,[10, 9], and axioms of ’Separability’ and ’Measurability’ on Simplex provided by Qin and...

Around 1947, von Neumann showed that for any finite two-person zero-sum game, there is a feasible linear programming (LP) problem consisting of a primal-dual pair of linear programs whose saddle points yield equilibria of the game, thus providing an immediate proof of the minimax theorem from...

In a conventional dial-a-ride-system passengers are moved with the same vehicle between their pickup and their drop-off location. In a dial-a-ride-system with transfer, it is possible (or even standard) that passengers change the vehicle once or several times. Transfer Scheduling Constraints...