The smallest point of a polytope

This note suggests new ways for calculating the point of smallest Euclidean norm in the convex hull of a given set of points inR ⁿ . It is shown that the problem can be formulated as a linear least-square problem with nonnegative variables or as a least-distance problem. Numerical experiments illustrate that the least-square problem is solved efficiently by the active set method. The advantage of the new approach lies in the solution of large sparse problems. In this case, the new formulation permits the use of row relaxation methods. In particular, the least-distance problem can be solved by Hildreth's method.     

An Improved Lower Bound for the Multimedian Location Problem

We consider the problem of locating, on a network, n new facilities that interact with m existing facilities. In addition, pairs of new facilities interact. This problem, the multimedian location problem on a network, is known to be NP-hard. We give a new integer programming formulation of this problem, and show that its linear programming relaxation provides a lower bound that is superior to the bound provided by a previously published formulation. We also report results of computational testing with both formulations.     

Mathematical models of the Bandpass problem and OrderMatic computer game

A new combinatorial optimization problem, the Bandpass problem, was defined in Bell and Babayev (2004) [4]. Recently, this problem was investigated in detail in Babayev et al. (2009) [5]. In this paper, we first present some new mathematical models of the Bandpass problem. Then related to this problem, we introduce a software called OrderMatic which is very useful for teaching permutations.     

A New 4 × 4 AKNS Spectral Problem and Its Associated Integrable Decomposition of the AKNS Equation

A new approach to construct a new 4×4 matrix spectral problem from a normal 2×2 matrix spectral problem is presented.AKNS spectral problem is discussed as an example.The isospectral evolution equation of the new 4×4 matrix spectral problem is nothing but the famous AKNS equation hierarchy.With the aid of the binary nonlino earization method,the authors get new integrable decompositions of the AKNS equation. In this process,the r-matrix is used to get the result.     

Notes on a new approximate solution of 2-D heat equation backward in time

In this paper, we consider a backward heat problem that appears in many applications. This problem is ill-posed. The solution of the problem as the solution exhibits unstable dependence on the given data functions. Using a new regularization method, we regularize the problem and get some new error estimates. Some numerical tests illustrate that the proposed method is feasible and effective. This work is a generalization of many recent papers, including the earlier paper [A new regularized method for two dimensional nonhomogeneous backward heat problem, Appl. Math. Comput. 215(3) (2009) 873–880] and some other authors such as Chu-Li Fu et al. ,  and , Campbell et al. [4].     

New facets for the two-stage uncapacitated facility location polytope

The two-stage uncapacitated facility location problem is considered. This problem involves a system providing a choice of depots and plants, each with an associated location cost, and a set of demand points which must be supplied, in such a way that the total cost is minimized. The formulations used until now to approach the problem were symmetric in plants and depots. In this paper the asymmetry inherent to the problem is taken into account to enforce the formulation which can be seen like a set packing problem and new facet defining inequalities for the convex hull of the feasible solutions are obtained. A computational study is carried out which illustrates the interest of the new facets. A new family of facets recently developed, termed lifted fans, is tested with success.     

Classification of Dantzig–Wolfe reformulations for binary mixed integer programming problems

In this note, we provide a classification of Dantzig–Wolfe reformulations for Binary Mixed Integer Programming Problems. We specifically focus on modeling the binary conditions in the convexification approach to the Dantzig–Wolfe decomposition. For a general Binary Mixed Integer Programming problem, an extreme point of the overall problem does not necessarily correspond to an extreme point of the subproblem. Therefore, the binary conditions cannot in general be imposed on the new master problem variables but must be imposed on the original binary variables. In some cases, however, it is possible to impose the binary restrictions directly on the new master problem variables. The issue of imposing binary conditions on the original variables versus the master problem variables has not been discussed systematically for MIP problems in general in the literature and most of the research has been focused on the pure binary case. The classification indicates in which cases you can, and cannot, impose binary conditions on the new master problem variables.     

On thek-cut subgraph polytope

We consider the problem of finding a minimum-cost set ofk pairwise-disjoint (s, t)-cuts in a graph. For non-negative costs, this problem was solved independently by Nishihara and Inoue, and Wagner. Both solutions involve formulating the problem as a linear-programming problem. In this paper, we give new polyhedral interpretations of the problem. Relationships to the path formulation of the maximum-flow problem are also established.Corresponding author.     

超AKNS方程新的可积分解

该文介绍从3×3矩阵形式超谱问题出发, 构造新高阶矩阵形式超谱问题的方法.以超AKNS方程为例, 作者构造了5×5矩阵形式的超AKNS谱问题并且运用双非线性化方法,给出了超AKNS方程的新约束, 得到该约束下超AKNS方程新的可积分解.     

The solution of the EMFL problem with two new facilities in a quadrangle

This paper is concerned with the analytical solution of the EMFL (Euclidean multifacility location) problem with two new facilities and four existing facilities. In Section 1, the optimality conditions for a general EMFL problem are summarized in the form presented in [1]. In Section 2, they are applied to the considered problem, in order to locate the new facilities and to partition the space of the weights (for a given set of existing facilities) into regions with the same type of solution. However, it is pointed out that a complete solution can be obtained only in particular cases.     

A novel method for solving a class of singularly perturbed boundary value problems based on reproducing kernel method

In this paper, a novel method is presented for solving a class of singularly perturbed boundary value problems. Firstly the original problem is reformulated as a new boundary value problem whose solution does not change rapidly via a proper transformation; then the reproducing kernel method is employed to solve the boundary value new problem. Numerical results show that the present method can provide very accurate analytical approximate solutions.     

The Gellerstedt problem for a parabolic-hyperbolic equation of the second kind

In this paper we consider the Gellerstedt problem for a parabolic-hyperbolic equation of the second kind. We prove the unique solvability of this problem by means of a new representation for a solution to the modified Cauchy problem in a generalized class R.     

New optimality conditions and a scalarization approach for a nonconvex semi-vectorial bilevel optimization problem

In this paper, we are concerned with the optimistic formulation of a semivectorial bilevel optimization problem. Introducing a new scalarization technique for multiobjective programs, we transform our problem into a scalar-objective optimization problem by means of the optimal value reformulation and establish its theoretical properties. Detailed necessary conditions, to characterize local optimal solutions of the problem, were then provided, while using the weak basic CQ together with the generalized differentiation calculus of Mordukhovich. Our approach is applicable to nonconvex problems and is different from the classical scalarization techniques previously used in the literature and the conditions obtained are new.

     

Galois points for a plane curve in arbitrary characteristic

In 1996, Hisao Yoshihara introduced a new notion in algebraic geometry: a Galois point for a plane curve is a point from which the projection induces a Galois extension of function fields. Yoshihara has established various new approaches to algebraic geometry by using Galois point or generalized notions of it. It is an interesting problem to determine the distribution of Galois points for a given plane curve. In this paper, we survey recent results related to this problem.      

Generalized K-T conditions and penalty functions for quasidifferentiable programming

In this paper,a quasidifferentiable programming problem with inequality constraintsis considered. First,a general form of optimality conditions for this problem is glven,which contains the results of Luderer,Kuntz and Scholtes. Next,a new generalized K-T condition is derived. The new optimality condition doesn‘t use Luderer‘s regularity assumption and ita Lagrangian multipliers don‘t depend on the particular elements in the superdifferentials of the object function and constraint functions, Finally,a penalty function for the prohlem is studied. Sufficient conditions of the penalty function attaining a global minimum are obtained.     

Another approach to multiobjective programming problems withF-convex functions

In this paper, optimality conditions for multiobjective programming problems havingF-convex objective and constraint functions are considered. An equivalent multiobjective programming problem is constructed by a modification of the objective function. Furthermore, anF—Lagrange function is introduced for a constructed multiobjective programming problem, and a new type of saddle point is introduced. Some results for the new type of a saddle point are given.     

Solving of second order nonlinear PDE problems by using artificial controls with controlled error

In this paper, we find the approximate solution of a second order nonlinear partial differential equation on a simple connected region inR ². We transfer this problem to a new problem of second order nonlinear partial differential equation on a rectangle. Then, we transformed the later one to an equivalent optimization problem. Then we consider the optimization problem as a distributed parameter system with artificial controls. Finally, by using the theory of measure, we obtain the approximate solution of the original problem. In this paper also the global error inL ₁ is controlled.     

The split common fixed point problem for generalized demimetric mappings in two Banach spaces

ABSTRACT

In this paper, we consider the split common fixed point problem for new demimetric mappings in two Banach spaces. Using the hybrid method, we prove a strong convergence theorem for finding a solution of the split common fixed point problem in two Banach spaces. Furthermore, using the shrinking projection method, we obtain another strong convergence theorem for finding a solution of the problem in two Banach spaces. Using these results, we obtain well-known and new strong convergence theorems in Hilbert spaces and Banach spaces.     

Interactive multiobjective optimization approach to the input–output design of opening new branches

We demonstrate a real-world application of the interactive multiple objective optimization (MOO) approach to the simultaneous setting of input and output amounts for the opening of new branches. As illustrated by the case example, all the branches of a fast-food company employ multiple inputs to generate multiple outputs. The company launches several new branches each year and, therefore, needs to plan the quantities of inputs and outputs to be used and produced before their operations. Such input–output settings are a vital practical problem that arises whenever a new branch is opened in a host of different industries. In this paper, we show in detail the entire process of the application from modeling the case problem to generating its solution. In the modeling stage, a data envelopment analysis model and a statistical method are subsequently utilized to form a nonlinear MOO problem for the input–output settings. To solve this problem, we then develop and apply an interactive MOO method, which combines the two earlier interactive methods ( and ), while compensating for their drawbacks and capturing their positive aspects.     

A New Method,the Fusion Fission,for the Relaxed <Emphasis Type="Italic">k</Emphasis>-way Graph Partitioning Problem,and Comparisons with Some Multilevel Algorithms

In this paper a new graph partitioning problem is introduced, the relaxed k-way graph partitioning problem. It is close to the k-way, also called multi-way, graph partitioning problem, but with relaxed imbalance constraints. This problem arises in the air traffic control area. A new graph partitioning method is presented, the Fusion Fission, which can be used to resolve the relaxed k-way graph partitioning problem. The Fusion Fission method is compared to classical Multilevel packages and with a Simulated Annealing algorithm. The Fusion Fission algorithm and the Simulated Annealing algorithm, both require a longer computation time than the Multilevel algorithms, but they also find better partitions. However, the Fusion Fission algorithm partitions the graph with a smaller imbalance and a smaller cut than Simulated Annealing does.