Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems

Whether or not the general asymmetric variational inequality problem can be formulated as a differentiable optimization problem has been an open question. This paper gives an affirmative answer to this question. We provide a new optimization problem formulation of the variational inequality problem, and show that its objective function is continuously differentiable whenever the mapping involved in the latter problem is continuously differentiable. We also show that under appropriate assumptions on the latter mapping, any stationary point of the optimization problem is a global optimal solution, and hence solves the variational inequality problem. We discuss descent methods for solving the equivalent optimization problem and comment on systems of nonlinear equations and nonlinear complementarity problems.     

Linear Complementarity Problems on Extended Second Order Cones

In this paper, we study the linear complementarity problems on extended second order cones. We convert a linear complementarity problem on an extended second order cone into a mixed complementarity problem on the non-negative orthant. We state necessary and sufficient conditions for a point to be a solution of the converted problem. We also present solution strategies for this problem, such as the Newton method and Levenberg–Marquardt algorithm. Finally, we present some numerical examples.     

A cutting plane algorithm for the Capacitated Connected Facility Location Problem

We consider a network design problem that arises in the cost-optimal design of last mile telecommunication networks. It extends the Connected Facility Location problem by introducing capacities on the facilities and links of the networks. It combines aspects of the capacitated network design problem and the single-source capacitated facility location problem. We refer to it as the Capacitated Connected Facility Location Problem. We develop a basic integer programming model based on single-commodity flows. Based on valid inequalities for the capacitated network design problem and the single-source capacitated facility location problem we derive several (new) classes of valid inequalities for the Capacitated Connected Facility Location Problem including cut set inequalities, cover inequalities and combinations thereof. We use them in a branch-and-cut framework and show their applicability and efficacy on a set of real-world instances.     

Optimal bundle pricing with monotonicity constraint

We consider the problem of pricing (digital) items in order to maximize the revenue obtainable from a set of bidders. We suggest a natural monotonicity constraint on bundle prices, show that the problem remains NP-hard, and we derive a PTAS. We also briefly discuss the highway pricing problem.     

The linear conjugation problem for bi-analytic functions

We consider a classical problem on linear conjugation problem for bi-analytic functions on smooth contour. We obtain explicit formula of a solution to a problem and describe necessary and sufficient conditions of its solvability.     

Inverse problem for a quasilinear hyperbolic equation with a nonlocal boundary condition containing a delay argument

We consider a problem for a quasilinear hyperbolic equation with a nonlocal condition that contains a retarded argument. By reducing this problem to a nonlinear integrofunctional equation, we prove the existence and uniqueness theorem for its solution. We pose an inverse problem of finding a solution-dependent coefficient of the equation on the basis of additional information on the solution; the information is given at a fixed point in space and is a function of time. We prove the uniqueness theorem for the solution of the inverse problem. The proof is based on the derivation and analysis of an integro-functional equation for the difference of two solutions of the inverse problem.     

A nonlinear nonlocal mixed problem for a second order pseudoparabolic equation

We study a nonlocal mixed problem for a nonlinear pseudoparabolic equation, which can, for example, model the heat conduction involving a certain thermodynamic temperature and a conductive temperature. We prove the existence, uniqueness and continuous dependence of a strong solution of the posed problem. We first establish for the associated linear problem a priori estimate and prove that the range of the operator generated by the considered problem is dense. The technique of deriving the a priori estimate is based on constructing a suitable multiplicator. From the resulted energy estimate, it is possible to establish the solvability of the linear problem. Then, by applying an iterative process based on the obtained results for the linear problem, we establish the existence, uniqueness and continuous dependence of the weak solution of the nonlinear problem.     

On the convergence of solutions and eigenelements of a boundary value problem in a domain perforated along the boundary

We consider a boundary value problem in a model domain periodically perforated along the boundary. We assume that the homogeneous Neumann condition is posed on the external boundary and the homogeneous Dirichlet condition is posed on the boundary of the cavities. A limit (homogenized) problem is obtained. We prove the convergence of the solutions, eigenvalues, and eigenfunctions of the original problem to the solutions, eigenvalues, and eigenfunctions, respectively, of the limit problem.     

Necessary and sufficient conditions for local Pareto optimality on time scales

We study a multiobjective variational problem on time scales. For this problem, necessary and sufficient conditions for weak local Pareto optimality are given. We also prove a necessary optimality condition for the isoperimetric problem with multiple constraints on time scales.     

热传导方程小波解的点态收敛

本文主要考虑热传导方程uxx=ut,0≤x<1,t≥0;u(1,t)=g(t),其中边界条件g(t)为已知函数．此定解问题为一不适定问题,也就是说当边界条件有微小扰动时,将会引起解大的扰动．本文将利用多分辨率分析构造一小波解,且证明此解是适定的,并给出所定义小波解与定解问题的真正解在点态意义下的误差估计．     

On the uniqueness of the solution of nonlinear differential-algebraic systems

We consider the Cauchy problem for a system of nonlinear ordinary differential equations unsolved for the derivative of the unknown vector function and identically degenerate in the domain. We prove a theorem on the coincidence of two smooth solutions of the considered problem. We show that, under some additional assumptions, the above-mentioned problem cannot have classical solutions with less smoothness. We obtain conditions under which the problem has a fixed finite number of solutions.     

On the solvability of the dirichlet problem for elliptic nondivergent equations of the second order in a domain with conical point

We study the problem of solvability of the Dirichlet problem for second-order linear and quasilinear uniformly elliptic equations in a bounded domain whose boundary contains a conical point. We prove new theorems on the unique solvability of a linear problem under minimal smoothness conditions for the coefficients, right-hand sides, and the boundary of the domain. We find classes of solvability of the problem for quasilinear equations under natural conditions.     

Using a Conic Formulation for Finding Steiner Minimal Trees

We present a new mathematical programming formulation for the Steiner minimal tree problem. We relax the integrality constraints on this formulation and transform the resulting problem (which is convex, but not everywhere differentiable) into a standard convex programming problem in conic form. We consider an efficient computation of an ε-optimal solution for this latter problem using an interior-point algorithm.     

Problem on small motions of ideal rotating relaxing fluid

We study an evolution problem on small motions of the ideal rotating relaxing fluid in bounded domains. We begin from the problem posing. Then we reduce the problem to a second-order integrodifferential equation in a Hilbert space. Using this equation, we prove a strong unique solvability problem for the corresponding initial-boundary value problem.     

Reflected BSDEs and the obstacle problem for semilinear PDEs in divergence form

We consider the Cauchy problem for a semilinear parabolic equation in divergence form with obstacle. We show that under natural conditions on the right-hand side of the equation and mild conditions on the obstacle, the problem has a unique solution and we provide its stochastic representation in terms of reflected backward stochastic differential equations. We also prove regularity properties and approximation results for solutions of the problem.     

Minisum collection depots location problem with multiple facilities on a network

We investigate the problem of locating a set of service facilities that need to service customers on a network. To provide service, a server has to visit both the demand node and one of several collection depots. We employ the criterion of minimizing the weighted sum of round trip distances. We prove that there exists a dominating location set for the problem on a general network. The properties of the solution on a tree and on a cycle are discussed. The problem of locating service facilities and collection depots simultaneously is also studied. To solve the problem on a general network, we suggest a Lagrangian relaxation imbedded branch-and-bound algorithm. Computational results are reported.     

A recurrence relation for estimating the size of set partitioning problem that can be completely aggregated on a given computer,using Kendall and Zionts aggregation scheme

We present and prove a proposition which defines a recurrence relation for computing, a priori, multipliers that are valid for any set partitioning problem. We further use the relation to establish a constructive method for estimating the size of set partitioning problem that can be completely aggregated on a given computer. The size largely depends on the number of rows of the problem. We also present some computational results.     

Robust formulations for economic lot-sizing problem with remanufacturing

In this paper, we consider a lot-sizing problem with the remanufacturing option under parameter uncertainties imposed on demands and returns. Remanufacturing has recently been a fast growing area of interest for many researchers due to increasing awareness on reducing waste in production environments, and in particular studies involving remanufacturing and parameter uncertainties simultaneously are very scarce in the literature. We first present a min-max decomposition approach for this problem, where decision maker’s problem and adversarial problem are treated iteratively. Then, we propose two novel extended reformulations for the decision maker’s problem, addressing some of the computational challenges. An original aspect of the reformulations is that they are applied only to the latest scenario added to the decision maker’s problem. Then, we present an extensive computational analysis, which provides a detailed comparison of the three formulations and evaluates the impact of key problem parameters. We conclude that the proposed extended reformulations outperform the standard formulation for a majority of the instances. We also provide insights on the impact of the problem parameters on the computational performance.     

A convex duality approach for pricing contingent claims under partial information and short selling constraints

We consider the pricing problem facing a seller of a contingent claim. We assume that this seller has some general level of partial information, and that he is not allowed to sell short in certain assets. This pricing problem, which is our primal problem, is a constrained stochastic optimization problem. We derive a dual to this problem by using the conjugate duality theory introduced by Rockafellar. Furthermore, we give conditions for strong duality to hold. This gives a characterization of the price of the claim involving martingale- and super-martingale conditions on the optional projection of the price processes.     

Multiple machine continuous setup lotsizing with sequence-dependent setups

We address the short-term production planning and scheduling problem coming from the glass container industry. A furnace melts the glass that is distributed to a set of parallel molding machines. Both furnace and machine idleness are not allowed. The resulting multi-machine multi-item continuous setup lotsizing problem with a common resource has sequence-dependent setup times and costs. Production losses are penalized in the objective function since we deal with a capital intensive industry. We present two mixed integer programming formulations for this problem, which are reduced to a network flow type problem. The two formulations are improved by adding valid inequalities that lead to good lower bounds. We rely on a Lagrangian decomposition based heuristic for generating good feasible solutions. We report computational experiments for randomly generated instances and for real-life data on the aforementioned problem, as well as on a discrete lotsizing and scheduling version.