Skip to content

Data Analysis and Business Modeling

CIS · Quiz · Summer 26

Paper 1 of 2Section A · Batch 232Switch

Section A · Batch 232

Paper 1 of 2

This browser can’t show the PDF here

Open it, and your phone’s PDF viewer takes it, or download it.

Read the questions as text

Read off the PDF by AI, so it may have mistakes. The PDF is the original.

Daffodil International University Department of Computing and Information System Class Test 3, Section: 18A, Set: B Course code: BI334, Course title: Data Analysis and Business Model Time: 30 minutes Full marks: 15 1. What is a linear programming? State the fundamental theorem of linear programming. 3 2. Explain two components of an LP model with suitable examples. 2 3. What is the Simplex method? How does it solve a linear optimization problem? 3 4. (a) True or false: In linear programming problem, the feasible region of is formed by non-linear constraints. 1 (b) True or false: The Interior-Point Method always starts from an interior point of the feasible region. 1 5. Consider the following linear programming problem: Maximize 4x1 + 3x2, subject to x1 + x2 ≤ 6, 2x1 + x2 ≤ 8, and x1, x2 ≥ 0 5 Answer the following: a) Identify the objective function. (1) b) How many decision variables are there? Name them. (1) c) How many constraints (excluding non-negativity constraints) are there? (1) d) Is the point (1,2) feasible? Show your calculation. (2)