By using a smooth entropy function to approximate the non-smooth max-type function, a verticallinear complementarity problem (VLCP) can be treated as a family of parameterized smoothequations. A Newton-type method with a testing procedure is proposed to solve sucha system. We show that the...

A new smoothing approach based on entropic perturbationis proposed for solving mathematical programs withequilibrium constraints. Some of the desirableproperties of the smoothing function are shown. Theviability of the proposed approach is supported by acomputationalstudy on a set of well-known...

This paper studies a pricing game in which two sellers compete to sell a product to a customer with bounded rationality. The sellers have different production costs in determining their respective prices to offer to the buyer. The buyer prefers the seller offering a lower price, but may suffer...

Cardinality constrained mean-variance (CCMV) portfolio selection problem is commonly formulated as a mixed integer quadratic program (MIQP) that can be solved by a branch-and-bound scheme or metaheuristics. Yet, computational efficiency remains to be a major issue. In this study, we propose a...

In this paper, we study a novel network design problem for the fourth-party logistics network (4PLN) to cope with accidental demand surges. A chance-constrained stochastic programming model is established to minimize the overall cost for 4PLN under service-level targets, where the stochastic...