Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
A clothing company makes coats and slacks. The two resources required are wool cloth and labor
The assignment problem constraint x31 + x32 + x33 + x34 <= 2 means
Formulate a linear mathematical programming model for the problem to satisfy the parents conditions.
ow many undergraduate and graduate courses should be taught in the fall so that total faculty salaries are kept to a minimum?
Graphically illustrate the feasible region and apply the isocost line procedure to indicate which corner point produces the optimal solution.
(a) What is the optimal solution? (b) If the first constraint is altered to X + 3Y (less than or equal to) 9, does feasible region or optimal solution change?
Evaluate the function f(x) = 9x - 6 for x=0 and x=5. Find the slope of the line through the points ( 5, -5) and ( 6, -1)
In using rounding of a linear programming model to obtain an integer solution, the solution is:
Q1. What is LP? How is an LP problem defined Q2. Define objective function, constraint, and decision variable
A direct-sequence spread-spectrum system using BPSK modulation for both the data and the code is required to support a data rate of 9600 bits/s.
Explain why a syndrome can be calculated by evaluating the received polynomial at each of the roots of the code's generator polynomial.
Use the method by Ford and Show the flow pattern. What is thFulkerson to determine a maximal flow. Show the flow pattern. What is the value of the maximal flow?
Use the Floyd-Warshall algorithm to determine the shortest paths between all pairs of nodes.
City Council plans the snow plowing strategies for next winter. The graph in Fig. shows the street network, which includes only one-way streets.
Is it possible for the post office to find a tour for the postman, so that the letter carrier has to traverse each street exactly once?
Consider the network shown in Fig, where the numbers next to the arcs consists of the lower and upper bound on the flow in the arc.
Consider the network in Fig. and determine the shortest paths from ns to all other nodes.
As the people in the district are fierce defenders of property rights, the roads were constructed parallel to the rectangular fields.
Consider Fig. and ignore the weights at the nodes. For p = 2, determine the vertex p-center with the bisection search algorithm.
Calculate the center-of-gravity, i.e., the optimal solution of the minisum location problem with squared Euclidean distances.
Set up the capture table and apply the Greedy heuristic to locate 3 facilities. Where should the facilities be located and what is the total capture?
Ignore the solution found in (b) and improve the solution in (a) by the vertex substitution method.
Write the APT geometry statements to define the hole positions of the part in Figure. Use the lower left corner of the part as the origin in the x-y axis system
Cutting speed = 0.4 m/see, feed a 0.10 min/rev, and table travel speed between holes = 500 mm/min. Postprocessor call statement is MACHIN/DRILL.04.
Use the TURRET command to call the different drills required. Cutting speed = 0.4 m/sec, feed = 0.10 mm/rev