Nonlinear mappings associated with the generalized linear complementarity problem

We show that the Cottle—Dantzig generalized linear complementarity problem (GLCP) is equivalent to a nonlinear complementarity problem (NLCP), a piecewise linear system of equations (PLS), a multiple objective programming problem (MOP), and a variational inequalities problem (VIP). On the basis of these equivalences, we provide an algorithm for solving problem GLCP.Project partially supported by a grant from Oak Ridge Associated Universities, TN, USA.     

Production Equilibrium Point in Multi-Unit Manufacturing Systems and The Vertical Linear Complementarity Problem

A model that selects and produces products at an equilibrium point in multi-unit manufacturing systems is presented. It enables each business subsystem in the company to select and produce products so that the whole organization meets both internal and external demands at minimum inventory cost. Unlike previously proposed models, this model does not place any restrictions on the number of products or services that each business subsystem can provide. Proofs are provided to show existence of solutions and solvability, and a numerical example is given to demonstrate the utility of the model.     

Existence theory and Q-matrix characterization for the generalized linear complementarity problem: Revisited

We provide conditions under which a vertical block matrix is a Q-matrix if one or all representative sub-matrices are Q-matrices and vice versa. It is also shown, by means of counterexamples, that Eq. (3) of [A.A. Ebiefung, Existence theory and Q-matrix characterization for the generalized linear complementarity problem, Linear Algebra Appl. 223/224 (1995) 155-169] is incorrect.     

The Generalized Linear Complementarity Problem: Least Element Theory and Z-Matrices

Existence of solutions to the Generalized Linear Complementarity Problem (GLCP) is characterized when the associated matrix is a vertical blockZ-matrix. It is shown that if solutions exist, then one must be the leastelement of the feasible region. Moreover, the vertical block Z-matrixbelongs to the class of matrices where feasibility implies existence of asolution to the GLCP. The concept of sufficient matrices of class Z isinvestigated to obtain additional properties of the solution set.     

A support submatrix for the generalized linear complementarity problem

We provide an algorithm that selects, in a polynomial time, a representative submatrix whose appropriately defined LCP solution solves the GLCP. An algorithm based on support submatrices is also presented.     

Design of a heuristic algorithm for the generalized multi-objective set covering problem

Computational Optimization and Applications - Set covering optimization problems (SCPs) are important and of broad interest because of their extensive applications in the real world. This study...     

The generalized Leontief input-output model and its application to the choice of new technology

The Leontief input-output model is generalized and formulated as a generalized linear complementarity problem. Conditions for existence of solutions are given, and solution techniques are reviewed. An application of the model to choosing new technologies is suggested.