MathGroup Archive 2000

[Date Index] [Thread Index] [Author Index]

Search the Archive

ConstrainedMin and vector-notation

  • To: mathgroup at
  • Subject: [mg21585] ConstrainedMin and vector-notation
  • From: nielsx at
  • Date: Sat, 15 Jan 2000 02:04:28 -0500 (EST)
  • Sender: owner-wri-mathgroup at

I have the following problem: (used to calculate the Farell efficiency
measure, for those interested)

min l


t(X) z <= l y
zi >= 0
z1 + ... + zn = 1

X: matrix, z, y: vectors, l: scalar
(t(X) is the matrix X transposed)

I want to solve this with ConstrainedMin. (I realize it can be rewritten on
matrixform and fed to LinearProgramming.)

The following works fine, but I wonder, if it's not possible to write it in
an easier way:

X = {{1, 3}, {7, 1}}
y = {8, 4}

n = Length[X];
zz = Table[z[i], {i, n}];
  Join[MapThread[LessEqual, {zz.X, l y}],
    Table[z[i] >= 0, {i, n}], {Plus @@ zz == 1}], Append[zz, l]]

The point is of course, that is has to work with

X = {{3, 6}, {4, 4}, {8, 2}}

too, and an y-vector of a higher dimension for that matter.

Can anyone help me write this more elegantly??

I often encounter situation where I have to define a vector like zz to obtain
a vector-solution (e.g. when using Solve). There has to be a simpler way.


Niels Elken Sønderby
nielsx at

Sent via
Before you buy.

  • Prev by Date: Re: Solve[wave equation,bound.cond.]
  • Next by Date: Re: Limit problem from analysis
  • Previous by thread: Re: Distance between permutations
  • Next by thread: NDSolve: Distinguishing equations