Linear complementarity problems and multiple objective programming
From MaRDI portal
(Redirected from Publication:689137)
Recommendations
- Linear complementarity problem and multiobjective optimization
- A note on linear complementarity problems and multiple objective programming
- Generallized Linear Complementarity Problem and Multiobjective Programming Problem
- Equivalence of vertical block linear complementarity problems and multi-objective programming problems
- scientific article; zbMATH DE number 653034
Cites work
- scientific article; zbMATH DE number 3912096 (Why is no real title available?)
- scientific article; zbMATH DE number 4010155 (Why is no real title available?)
- scientific article; zbMATH DE number 3997507 (Why is no real title available?)
- A finite descent theory for linear programming, piecewise linear convex minimization, and the linear complementarity problem
- Bimatrix Equilibrium Points and Mathematical Programming
- Block pivot methods for solving the complementarity problem
- Efficiency in multiple objective optimization problems
- Existence of efficient solutions for vector maximization problems
- Finding all efficient extreme points for multiple objective linear programs
- Global Optimization Approach to the Linear Complementarity Problem
- Goal programming and multiple objective optimizations. Part I
- Lagrange multipliers and generalized differentiable functions in vector extremum problems
- Linear complementarity problems solvable by A single linear program
- Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
- Multiple-objective programming with polynomial objectives and constraints
- NP-completeness of the linear complementarity problem
- Non-convexity in noncooperative game theory
- On Quadratic Programming
- On a particular quadratic network problem
- On efficient sets in vector maximum problems - A brief survey
- On solving linear complementarity problems as linear programs
- Parallel search algorithms in global optimization
- Proper efficiency and the theory of vector maximization
- Some classes of matrices in linear complementarity theory
- The Linear Complementarity Problem
- The range of the efficient frontier in multiple objective linear programming
Cited in
(14)- scientific article; zbMATH DE number 1507325 (Why is no real title available?)
- Unified approaches for solvable and unsolvable linear complementarity problems
- A note on linear complementarity problems and multiple objective programming
- Linear optimization with multiple equitable criteria
- A constraint shifting homotopy method for finding a minimal efficient solution of nonconvex multiobjective programming
- Finding a minimal efficient solution of a convex multiobjective program
- On the upper semi-continuity of the solution map to the vertical implicit homogeneous complementarity problem of type \(R_{0}\)
- Bounded homotopy path approach to the solution of linear complementarity problems
- A modified constraint shifting homotopy method for solving general nonlinear multiobjective programming
- Linear complementarity problem and multiobjective optimization
- Multiple-objective approximation of feasible but unsolvable linear complementarity problems
- Equivalence of vertical block linear complementarity problems and multi-objective programming problems
- The Linear Complementarity Problems with a Few Variables per Constraint
- Generallized Linear Complementarity Problem and Multiobjective Programming Problem
This page was built for publication: Linear complementarity problems and multiple objective programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q689137)
