Mathematics Homework Solutions

Linear Programming Problem

FarmFresh Foods manufactures a snack mix called TrailTime by blending three ingredients: a dried fruit mixture, a nut mixture, and a cereal mixture. Information about the three ingredients (per ounce) is shown below. Ingredient Cost Volume FatGrams Calories Dried Fruit .35 .25 cup 0 ...continues

Proof of Vertex, Extreme Point, Basic Feasible Solution

Can you please let me know how to approach those proof questions. Consider the polyhedron P = {x  Rn : xi > 0 for all i = 1 … n}. a)Prove that the origin (i.e. the vector of all 0's) is a vertex of P, according to the definition of a vertex (i.e. do not rely on the fact that vertex = extreme point = basic feasible ...continues

Justify LP statement

I am looking into how to justify these statements. --- For each statement, state whether it is true or false. Be sure to justify your answer. a) Suppose you are given a linear program in Rn with mE equality constraints and mI inequality constraints. Let x be an element of the polyhedron at which n - mE inequality constrai ...continues

Optimal solution subject to constraints proof

Please see attachment and help me how to prove this problem. (See attached file for full problem description) --- Consider a feasible solution y to the linear program Min cx St Ax = b x > 0 Let Z = {i | yi = 0}. Show that y is an optimal solution if and only if the following linear program has an optimal o ...continues

Simplex Method

(See attached file for full problem description) --- a) Consider the following linear program: Min 5a + 4b - c + 2e St a - 2c + d + 2e = 1 3b + 3c + 6d - 9e = 3 a, b, c, d, e > 0 Using the optimality criteria from the simplex method, argue whether or not {a, b} is an optimal basis. ---

Largest possible adjacent basic feasible solution

For a given basic feasible solution in a problem in standard form with no degenerate extreme points, what is the largest possible number of adjacent basic feasible solutions that it can have, as a function of n and m? Give an example of when it will be strictly fewer than this number.

Tableau Simplex Method

(See attached file for full problem description)

Feasibility of a linear problem

(See attached file for full problem description)

Proof related to adjacency of basic feasible solution in LP

Can anyone finish up this proof by continuing my preliminery work? I started but can't finish this. I know starting by adding up the point z is correct way, but just can't continue to show if and only if. (See attached file for full problem description) --- Assume , , with rank (A) = m are given. Two different basic ...continues

Condition when dual is identical to the primal

(See attached file for full problem description)

Browse