Write Down (Without Solving) the Dual Linear Programming Problem $C = 13 s + 35 t$

question 18

Multiple Choice

Write down (without solving) the dual linear programming problem. Minimize $C = 13 s + 35 t$ subject to the following. $$\begin{array} { l } 7 s - 3 t \geq 15 \\s + 4 t \geq 25 \\s \geq 0 , t \geq 0\end{array}$$

• A)Maximize \(P = 15 x + 25 y\) subject to the following. \[\begin{array} { l }
• 7 x + y \leq 13 \\
• - 3 x + 4 y \leq 35 \\
• x \leq 0 , y \leq 0
• \end{array}\]
• B) Maximize \(P = 15 x + 25 y\) subject to the following.
• \[\begin{array} { l }
• 7 x + y \leq 13 \\
• 3 x + 4 y \leq - 35 \\
• x \geq 0 , y \geq 0
• \end{array}\]
• C) Maximize \(P = 15 x + 25 y\) subject to the following.

Understanding the distinction and similarities between leaders and managers.

Comprehending various classifications and theories of leadership such as trait, skill, and process approaches.

Grasping the concepts of power and influence within leadership roles.

Recognizing the evolution of leadership definitions and theories across time.