Privacy-preserving horizontally partitioned linear programs with inequality constraints
type: Item
instance of: scholarly article
title: Privacy-preserving horizontally partitioned linear programs with inequality constraints
zbMATH Open document ID: 1261.90025
author: Wei Li
author: Haohao Li
author: Chongyang Deng
published in: Optimization Letters
publication date: 2013-02-07T00:00:00Z
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 6135053
zbMATH Keywords: privacy-preserving
zbMATH Keywords: horizontally partitioned data
MaRDI profile type: Publication
full work available at URL: s11590-011-0403-2
OpenAlex ID: W2070787726
cites work: Privacy-preserving linear programming
cites work: Privacy-preserving horizontally partitioned linear programs
cites work: The rank of a random matrix
DOI: 10.1007/S11590-011-0403-2
Recommended article: Privacy-preserving horizontally partitioned linear programs
Recommended article: An inference-proof approach to privacy-preserving horizontally partitioned linear programs
Recommended article: Privacy-preserving vertically partitioned linear program with nonnegativity constraints
Recommended article: Privacy-preserving linear programming
Recommended article: Privacy-preserving linear and nonlinear approximation via linear programming
Recommended article: Privately Solving Linear Programs
Recommended article: A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations
Recommended article: Q5498204
Recommended article: Computing payoff allocations in the approximate core of linear programming games in a privacy-preserving manner
description: scientific article; zbMATH DE number 6135053