1999•OptimizationRequires access

Generallized Linear Complementarity Problem and Multiobjective Programming Problem

D. S. Bhatia, Pankaj Kumar Gupta

Abstract

In this paper we establish an equivalence between the solutions of a generalized linear complementarity problem and efficient points of a related nonlinear (quadratic) multiobjective programming problem. An algorithm based on multiple objective programming approach is presented to solve generalized linear complementarity problem

About this research paper

What this paper is about

Why it matters

OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Mixed complementarity problem, Linear complementarity problem, Mathematics, Mathematical optimization, Complementarity (molecular biology), Complementarity theory, Criss-cross algorithm, Linear-fractional programming