This is a preview. Log in through your library . Abstract We apply a potential reduction algorithm to solve the general linear complementarity problem (GLCP) minimize ...
The problem of applying Generalized Lagrange Multipliers (GLM) to 0-1 integer programming problems is investigated. It is shown that GLM can produce optimal solutions if and only if these solutions ...
This project aims at popularizing the usage of numerical methods, and in particular, linear programming techniques, for solving various types of information- and incentive-constrained problems in ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback