Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Solved Assignments
Asked Questions
Answered Questions
consider the path flow formulation of the multi commodity flow problem of section 887 assume that for each od pair im
shortest path problems with losses consider the shortest path-like problem of exercise 231 where a vehicle wants to go
constrained max-flow problem consider the max-flow problem of chapter 3 with the exception that there is a single side
piecewise differentiable arc costs consider the convex separable problem of section 81 where each arc cost function fij
dynamic network flows the arcs i j of a graph carry flow xij t in time period t where t 1t each arc requires one time
consider a network with two nodes 1 and 2 with supplies s1nbsp 1 and s2nbsp -1 and three arcspaths connecting 1 and 2
consider the convex separable problem of fig 822 where each arc cost functionnbspa find the optimal solution and verify
exact penalty functions consider a problem where each function fij is convex over the entire real line and there is a
consider a problem with two nodes 1 and 2 and two arcs 1 2 and 2 1 the node supplies are s1nbsp s2nbsp 0 the problem
proof of a weaker version of the duality theorem show that if the primal problem is feasible and the intervals xij are
1 the median sales prices for new single-family houses for the years 1998-2001 are as follows statistical abstract of
consider the rollout algorithm for the traveling salesman problem using as base heuristic the nearest neighbor method
consider the cutting plane method a give an example where the generated sequence qmicrok is not monotonically
a convergent variation of the sub gradient method this exercise provides a convergence result for a common variation of
convergence of the subgradient method consider the subgradient methodand qlowast is the optimal dual cost this stepsize
duality gap of the knapsack problem given objects i 1n with positive weights wi and values vi we want to assemble a
constraint relaxation and lagrangian relaxation the purpose of this exercise is to compare the lower bounds obtained by
lagrangian relaxation in multidimensional assignment apply the lagrangian relaxation method to the multidimensional
enforced separation in 3-dimensional assignment consider the 3-dimensional assignment problem of example 107 that
this exercise shows that non differentiabilities of the dual function given in section 103 often tend to arise at the
rollout algorithm for the quiz problem consider the quiz problem of exercise 1028 for the case where the maximum number
the quiz problem consider a quiz contest where a person is given a list of n questions and can answer these questions
hardys theoremnbspnbspbe monotonically nondecreasing sequences of numbers let us associate with each i 1n a distinct
a busy professor has to complete n projects each project i has a deadline di and the time it takes the professor to
weighted shortest processing time first rule we want to schedule n tasks the ith of which requires ti time units let ti