Explore the vast range of titles available.

Several computer programs that can implement the Out-of-Kilter algorithm have been written. To date programs have been written in Fortran, Algol, Pascal, Basic, C++ and Matlab. According to the knowledge of the author, a program to do this in R has not yet been written. The R program written in this article can solve both the maximum flow and minimum cost-maximum flow problems. Since the Out-of-Kilter algorithm has a network flow as input, it can also be used to solve the flow in any problem whose information can be presented in the form of a network flow. This includes among others the transportation problem, the assignment problem, the shortest route problem and the caterer problem.

Although the impact of governance on interfirm relationships has been extensively studied, the role of information technology (IT) as a governance mechanism in platform ecosystems remains underexplored. Drawing on agency theory, this research examines the differing impacts of IT monitoring and reputation badges on participation slackness and value co-creation of digital platform complementors, as well as the moderating role of IT support. The empirical findings from the survey of 278 complementors and secondary datasets indicate that IT monitoring and reputation badges mitigate complementors’ slackness, while reputation badges encourage complementors’ value co-creation behaviors. Furthermore, the negative relationship between reputation badges and participation slackness and the positive effect of reputation badges on value co-creation are stronger when IT support of the platform is high. Similarly, the positive impact of IT monitoring on complementors’ value co-creation is reinforced when IT support is high. Overall, the study confirms the impact of IT governance on various types of complementor behaviors and highlights the contingent role of IT support.

We consider higher-order conditions and sensitivity analysis for solutions to equilibrium problems. The conditions for solutions are in terms of quasi-contingent derivatives and involve higher-order complementarity slackness for both the objective and the constraints and under Hölder metric subregularity assumptions. For sensitivity analysis, a formula of this type of derivative of the solution map to a parametric equilibrium problem is established in terms of the same types of derivatives of the data of the problem. Here, the concepts of a quasi-contingent derivative and critical directions are new. We consider open-cone solutions and proper solutions. We also study an important and typical special case: weak solutions of a vector minimization problem with mixed constraints. The results are significantly new and improve recent corresponding results in many aspects.

Geomembrane relaxation can effectively prevent the geomembrane from being damaged by tensile stresses caused by temperature changes and uneven settlement of the foundation. Existing and commonly used reservation methods, such as wave-shaped, groove-shaped, and Z-shaped techniques, are unidirectional and cannot resist multidirectional tensile stresses in geomembranes. Therefore, we propose three methods for reserving bidirectional geomembranes, including the cross-groove-shaped, cross-Z-shaped, and combined Z- and groove-shaped techniques. Additionally, we investigate the key issues of these methods and their practicality through field tests and theoretical analyses. The results of the study show that the cross-groove-shaped technique is prone to geomembrane folding at the corners of the cross-intersection, and it is necessary to set a wiping angle of approximately 35° to solve the problem. The cross-Z-shaped technique does not require grooving and reduces the amount of civil construction performed. However, the neoprene rods cannot be folded 180° or restored after being separated once. The combined Z- and groove-shaped technique has no folding phenomenon and does not require 180° of folding. With a lack of folding, including 180° folding, the number of grooves can be reduced by half, but the cross-Z-shaped specimen cannot be restored after separation. In practical applications, it is recommended to use the cross-groove-shaped method or to choose a suitable bidirectional reservation method according to the actual requirements.

This paper considers higher-order necessary conditions for Henig-proper, positively proper and Benson-proper solutions. Under suitable constraint qualifications, our conditions are of the Karush–Kuhn–Tucker rule. The conditions include higher-order complementarity slackness for both the objective and the constraining maps. They are in a nonclassical form with a supremum expression on the right-hand side (instead of zero). Our results are new and improve the existing ones in the literature, even when applied to special cases of multiobjective single-valued optimization problems.

Employee slackness is a prevalent behavior among current corporate employees, and this behavior harms both employee personal development and organizational effectiveness. In this study, factors are extracted from four levels: employee, leader, company, and job, and the relationships of factors influencing employee slackness are sorted out using the explanatory structural model (ISM) and the cross-influence matrix multiplication method (MICMAC), and corresponding conclusions are drawn based on the relevant mechanistic models. The results of the study show that a strong sense of overqualification and less meaningful work as independent group factors have the deepest influence on corporate employees to produce slacking behavior. The findings of this study help enterprises to understand the influencing factors of employees’ slacking behavior at a deeper level; they also provide important management insights for enterprise managers to pay attention to and alleviate employees’ slacking emotions and negative work behaviors.

We consider a bilevel “defender-attacker” model built on the basis of the Stackelberg game. In this model, given is a set of the objects providing social services for a known set of customers and presenting potential targets for a possible attack. At the first step, the Leader (defender) makes a decision on the protection of some of the objects on the basis of his/her limited resources. Some Follower (attacker), who is also limited in resources, decides then to attack unprotected objects, knowing the decision of the Leader. It is assumed that the Follower can evaluate the importance of each object and makes a rational decision trying to maximize the total importance of the objects attacked. The Leader does not know the attack scenario (the Follower’s priorities for selecting targets for the attack). But, the Leader can consider several possible scenarios that cover the Follower’s plans. The Leader’s problem is then to select the set of objects for protection so that, given the set of possible attack scenarios and assuming the rational behavior of the Follower, to minimize the total costs of protecting the objects and eliminating the consequences of the attack associated with the reassignment of the facilities for customer service. The proposed model may be presented as a bilevelmixed-integer programming problem that includes an upper-level problem (the Leader problem) and a lower-level problem (the Follower problem). The main efforts in this article are aimed at reformulation of the problem as some one-level mathematical programming problems. These formulations are constructed using the properties of the optimal solution of the Follower’s problem, which makes it possible to formulate necessary and sufficient optimality conditions in the form of linear relations.

A general approach is proposed in order to measure returns to scale and scale elasticity at projections points in the radial data envelopment analysis (DEA) models. In the first stage, a relative interior point belonging to the optimal face is found using a special, elaborated method. In previous work it was proved that any relative interior point of a face has the same returns to scale as any other interior point of this face. In the second stage, we propose to determine the returns to scale at the relative interior point found in the first stage.

Using properties of the difference schemes approximating a one-dimensional transport equation as an example, it is shown that optimization of the properties of difference schemes based on the analysis in the space of undetermined coefficients and optimization of these properties based on the method of parametric correction are dual problems. Hybrid difference schemes for the linear transport equation are built as solutions to dual linear programming problems. It is shown that Godunov’s theorem follows from the linear program optimality criterion as one of the complementary slackness conditions. A family of hybrid difference schemes is considered. It is shown that Fedorenko’s hybrid difference scheme is obtained by solving the dual linear programming problem.

Construction of difference schemes of high approximation orders for hyperbolic problems is still an important problem. For the construction of grid-characteristic methods, difference schemes were earlier analyzed in the space of undetermined coefficients, where the coefficients of high order derivatives in the first differential approximation of the difference scheme were used as the objective function to be minimized. Other reasonable functionals in the space of undetermined coefficients that are linear in the coefficients of the scheme may be used. By solving a linear programming problem, difference schemes meeting various conditions can be chosen. An example of the linear functional related to the approximation properties of the problem is discussed. It is proposed to call it the generalized approximation condition. Based on this condition, a difference scheme of a novel class is built that has no analogs in the literature. The presentation uses the transport equation with a constant coefficient as an example.