Linear programming with variable matrix entries

We consider linear programming (continuous or integer) where some matrix entries are decision parameters. If the variables are nonnegative the problem can be easily solved in two phases. It is shown that direct costs on the matrix entries make the problem NP-hard. Finally, a strong duality result is provided.