Solve the linear programming problems in Problem 21-36 by applying the simplex method to the dual problem. Minimize C = 5 x 1 + 7 x 2 subject to x 1 ≥ 4 x 1 + x 2 ≥ 8 x 1 + 2 x 2 ≥ 10 x 1 , x 2 ≥ 0
Solve the linear programming problems in Problem 21-36 by applying the simplex method to the dual problem. Minimize C = 5 x 1 + 7 x 2 subject to x 1 ≥ 4 x 1 + x 2 ≥ 8 x 1 + 2 x 2 ≥ 10 x 1 , x 2 ≥ 0
Solution Summary: The author explains how to calculate the solution of the minimization problem by determining the dual form of it.
(4) (8 points)
(a) (2 points) Write down a normal vector n for the plane P given by the equation
x+2y+z+4=0.
(b) (4 points) Find two vectors v, w in the plane P that are not parallel.
(c) (2 points) Using your answers to part (b), write down a parametrization r: R² —
R3 of the plane P.
(2) (8 points) Determine normal vectors for the planes given by the equations x-y+2z = 3
and 2x + z = 3. Then determine a parametrization of the intersection line of the two
planes.
(3) (6 points)
(a) (4 points) Find all vectors u in the yz-plane that have magnitude [u
also are at a 45° angle with the vector j = (0, 1,0).
= 1 and
(b) (2 points) Using the vector u from part (a) that is counterclockwise to j, find an
equation of the plane through (0,0,0) that has u as its normal.
Chapter 6 Solutions
Finite Mathematics for Business, Economics, Life Sciences and Social Sciences
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.
Solve ANY Optimization Problem in 5 Steps w/ Examples. What are they and How do you solve them?; Author: Ace Tutors;https://www.youtube.com/watch?v=BfOSKc_sncg;License: Standard YouTube License, CC-BY
Types of solution in LPP|Basic|Multiple solution|Unbounded|Infeasible|GTU|Special case of LP problem; Author: Mechanical Engineering Management;https://www.youtube.com/watch?v=F-D2WICq8Sk;License: Standard YouTube License, CC-BY