Related questions
Question
Transcribed Image Text:1. Consider the following standard production problem
Maximize c'x
s.t. Ax <= b
Xi >= 0
Where A is an m by n matrix (m constraints and n variables), x is an n by 1 vector, and b
is an m by 1 vector. A' is the transpose matrix of A.
Its dual problem is
Minimize b'y
s.t. A'y c
Yi >= 0
For the given primal problem below, write out the dual problem in the table.
PRIMAL
Maximize
3x1+5x2
Subjected to x1<= 4 (resource 1)
2x2< 12 (resource 2)
3x1+2x2<=18 (resource 3)
X1,
X2 >= 0
DUAL
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution
Trending nowThis is a popular solution!
Step by stepSolved in 2 steps with 1 images
Knowledge Booster
Similar questions
- Write a MATLAB function that implements Gaussian Elimination with support for both partial pivoting and full pivoting for use in computing the inverse of a matrix. Do not use MATLAB-provided functions that directly implement Gaussian Elimination or compute inverses. Demonstrate the use of your function to invert a matrix A of your choice. You function should return a matrix B that is the inverse of matrix A. Your function should take the following input parameters: the matrix A, and an integer indicating the mode of operation with 0=no pivoting, 1=partial pivoting, and 2=full pivoting.arrow_forwardmatrix of dimension m*n where each cell in the matrix can have values 0, 1 or 2 which has the following meaning: 0: Empty cell 1: Cells have fresh oranges 2: Cells have rotten oranges So we have to determine what is the minimum time required so that all the oranges become rotten. A rotten orange at index [i,j] can rot other fresh orange at indexes [i-1,j], [i+1,j], [i,j-1], [i,j+1] (up, down, left and right). If it is impossible to rot every orange then simply return -1. Examples: Input: arr[][C] = { {2, 1, 0, 2, 1}, {1, 0, 1, 2, 1}, {1, 0, 0, 2, 1}}; Output: All oranges can become rotten in 2 time frames.Input: arr[][C] = { {2, 1, 0, 2, 1}, {0, 0, 1, 2, 1}, {1, 0, 0, 2, 1}}; Note: solve as soon as possible use c++ languagearrow_forwardArtificial Intelligence. A* search is essentially a uniform cost BFS heuristic search technique. What characteristics ofthe search space and of the heuristic function could make it better to use uniform cost BFS thanto use A* search? (Hint: consider the total cost of searching to find a solution.)arrow_forward
- Let A be the n x n matrix with n = 1000 and entries A(i, i) = i, A(i, i + 1) = A(i + 1, i) = 1/2, A(i, i + 2) = A(i + 2, i) = 1/2 for all i that fit within the matrix.arrow_forward7. Consider the following decision problem on satisfying inequalities. Let A be an integer m x n matrix. Let b be a vector of length m where each coordinate is an integer. You need to decide whether there exists a vector x of length n such that each of its [1 0 -3 위 coordinates is 0 or 1 and Arb. For example, let A = Then x = −1 1 and b = -2 [33] 1601 , satisfies Ararrow_forwardplease helparrow_forward17. Let A and B be two n × n matrices. Show that a) (A + B)^t = A^t + B^t . b) (AB)^t = B^t A^t . If A and B are n × n matrices with AB = BA = In, then B is called the inverse of A (this terminology is appropriate because such a matrix B is unique) and A is said to be invertible. The notation B = A^(−1) denotes that B is the inverse of A.arrow_forwardLet A be a n x m matrix of 0's and 1's. Design a dynamic programming O(nm) time algorithm for finding the largest square block of A that contains 1's only. When designing the dynamic programming algorithm, please describe the size and dimensionality of the dynamic programming table, and explicitly formulate the recurrence relationship. Hint: Define the dynamic programming table 1(i, j) be the length of the side of the largest square block of 1's whose bottom right corner is A[i, j].arrow_forwardConsider the following instance of 0-1 Knapsack problem: Item Profit Weight 11 9 5 12 6 7 13 7 4 14 5 5 15 9 8 The maximum weight of 16 Kg is allowed in the knapsack. The assumption is that each time an item is either taken completely or is left behind; she cannot take a fractional amount of an item or take an item more than once. Given the above set-up, using BRANCH AND BOUND methodology pick a subset of these items such that their total weight is no more than 16 Kg and their total value is maximized.arrow_forward1.arrow_forwardUsing Python, to help solve the following problem. Provide an explanation of your solutions to the problem. 4. A symmetric matrix D is positive definite if x¹TDx > 0 for any nonzero vector x. It can be proved that any symmetric, positive definite matrix D can be factored in the form D = LLT for some lower triangular matrix L with nonzero diagonal elements. This is called the Cholesky factorization of D. Consider the matrix [2.25 -3 4.5 -10 -3 5 4.5 -10 34 a. Is A positive definite? Explain. A = b. Find a lower triangular matrix L such that LLT = A.arrow_forward4. Let A be a m x n matrix where each element is 0 or 1. We are interested in finding the largest square sub-matrix of A such that each of its elements is 1. Design a dynamic-programming algorithm, running in O(mn) time, that finds such a largest [1 0 0 1 1 1 1 1 1 1 101 0 square sub-matrix in A. For example, let A = 0 1 1 1 1 0 1 1 1 1 1 1 1 10 In this case, the 3 × 3 square submatrix formed by columns 2, 3, 4 and rows 4, 5, 6 of all 1s should be returned by the algorithm.arrow_forwardarrow_back_iosSEE MORE QUESTIONSarrow_forward_ios