Addendum to: “Hamilton-laceable bi-powers of locally finite bipartite graphs” [Discrete Math. 345 (2022) 112777]

In this addendum we give a short and easy negative answer to the two questions raised in the original article.     

A Goal Programming model of the reference point method

Real-life decision problems are usually so complex they cannot be modeled with a single objective function, thus creating a need for clear and efficient techniques of handling multiple criteria to support the decision process. The most commonly used technique is Goal Programming. It is clear and appealing, but in the case of multiobjective optimization problems strongly criticized due to its noncompliance with the efficiency (Pareto-optimality) principle. On the other hand, the reference point method, although using similar control parameters as Goal Programming, always generates efficient solutions. In this paper, we show how the reference point method can be modeled within the Goal Programming methodology. It allows us to simplify implementations of the reference point method as well as shows how Goal Programming with relaxation of some traditional assumptions can be extended to a multiobjective optimization technique meeting the efficiency principle.     

Finding an efficient solution to linear bilevel programming problem: An effective approach

Multilevel programming is developed to solve the decentralized problem in which decision makers (DMs) are often arranged within a hierarchical administrative structure. The linear bilevel programming (BLP) problem, i.e., a special case of multilevel programming problems with a two level structure, is a set of nested linear optimization problems over polyhedral set of constraints. Two DMs are located at the different hierarchical levels, both controlling one set of decision variables independently, with different and perhaps conflicting objective functions. One of the interesting features of the linear BLP problem is that its solution may not be Paretooptimal. There may exist a feasible solution where one or both levels may increase their objective values without decreasing the objective value of any level. The result from such a system may be economically inadmissible. If the decision makers of the two levels are willing to find an efficient compromise solution, we propose a solution procedure which can generate effcient solutions, without finding the optimal solution in advance. When the near-optimal solution of the BLP problem is used as the reference point for finding the efficient solution, the result can be easily found during the decision process.     

贷款分配方法的数学模型及其解法

为了解决三角债问题，银行给出一笔贷款，应该如何分配这笔贷款，使清理的债务达到最大。本文建立这个问题的数学模型，并且给出一个解法。     

Fréchet Spaces of Holomorphic Functions without Copies of l1

Let X be a Banach space. Let H_w*(X*) the Fréchet space whose elements are the holomorphic functions defined on X* whose restrictions to each multiple mB(X*), m = 1,2, …, of the closed unit ball B(X*) of X* are continuous for the weak-star topology. A fundamental system of norms for this space is the supremum of the absolute value of each element of H_w*(X*) in mB(X*), m = 1,2,…. In this paper we construct the bidual of l₁ when this space contains no copy of l¹. We also show that if X is an Asplund space, then H_w*(X*) can be represented as the projective limit of a sequence of Banach spaces that are Asplund.     

Detecting embedded pure network structures in LP problems

Recently, linear programming problems with special structures have assumed growing importance in mathematical programming. It is well known that exploiting network structures within linear programs can lead to considerable improvement of the computational solution of large-scale linear programming problems. A linear program is said to contain an embedded network structure provided that some subset of its constraints can be interpreted as specifying conservation of flow. If a column of the constraint matrix has at most two non-zeros, then it leads to embedded generalized network structure and if these non-zeros are unit elements and of opposite signs, then it leads to embedded pure network structure. In this paper, we are concerned with algorithms for detecting embedded pure network structures within linear programs. The network extraction methods are presented in two groups. The first group covers deletion and addition based algorithms and the second group covers GUB based algorithms. We have extended the GUB based algorithm appearing in the second group by introducing Markowitz merit count approach for exploiting matrix non zeros. A set of well known test problems has been used to carry out computational experiments which show that our extensions to the GUB based algorithms give better results than the algorithms reported earlier.     

关于二次规划问题分段线性同伦算法的改进

本文利用Ｃｈｏｌｅｓｋｙ分解，Ｇａｕｓｓ消去等技术和定义适当的同伦映射，将关于二次规划问题的分段线性同伦算法加以改进，改进后的算法，对于严格凸二次规划来说，计算效率与Ｇｏｌｄｆａｒｂ－Ｉｄｎａｎｉ的对偶法相当。     

Interactive optimization

Optimization algorithms or heuristics in which the user interacts significantly either during the solution process or as part of post-optimality analysis are becoming increasingly popular. An important underlying premise of such man/machine systems is that there are some steps in solving a problem in which the computer has an advantage and other steps in which a human has an advantage. This paper first discusses how man/machine systems can be useful in facilitating model specification and revision, coping with aspects of a problem that are difficult to quantify and assisting in the solution process. We then survey successful systems that have been developed in the areas of vehicle scheduling, location problems, job shop scheduling, course scheduling, and planning language-based optimization.     

Global saddle-point duality for quasi-concave programs

General and quasi-concave non-differentiable cases of the maximization of the minimun between two functions are considered. With the aid of duality theory for mathematical programming involving conjugate-like operators and by defining a bifunction we construct a new Lagrangian and generate a class of perturbations. New saddle-point theorems are presented, and equivalence is proved between the existence of a saddle-point and the existence of a certain cone-supporting property of the perturbation function. These results suggest possible improvements in multiplier methods.This work was partially supported by a grant from Control Data.     

Stochastic dynamics of two-dimensional infinite-particle systems

The time evolution of an open system of infinitely many two-dimensional classical particles is investigated. Particles are interacting by a singular pair potentialU, and each particle is connected to a heat bath of temperatureT. The heat baths are represented by independent white noise forces and Langevin damping terms. Existence of strong solutions to the corresponding infinite system of stochastic differential equations is proved for initial configurations with a logarithmic order of energy fluctuations. Gibbs states forU at temperatureT are invariant under time evolution.