3. 1-and-bound algorithm to solve the following problem: max 2x + 3y s.t. 6x + 4y s7 Osxs1 Osys1 X, y integer Complete the following branch-and-bound tree. Insert - for infeasible problem objective function. Branch on x first and show the branching constraints used. Use only the boxes you need and mark unused ones with large X. Indicate fathomed problems by double line under their boxes. LPO Objective function-4 x-0.5, y-1

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
1
3. Branch-and-bound. Use the branch-and-bound algorithm to solve the following problem:
max
2x + 3y
s.t.
6x + 4y s7
Osys1
X, y integer
Complete the following branch-and-bound tree. Insert -o for infeasible problem objective function.
Branch on x first and show the branching constraints used. Use only the boxes you need and mark
unused ones with large X. Indicate fathomed problems by double line under their boxes.
LPO
Objective function-4
x-05, y-1
LP 2
LP 1
Objective function-
Objective function=
LP
LP
LP
LP
Objective function-
Objective function-
Objective function-
Objective function-
Optimal solution is:
Value of optimal solution:
Transcribed Image Text:3. Branch-and-bound. Use the branch-and-bound algorithm to solve the following problem: max 2x + 3y s.t. 6x + 4y s7 Osys1 X, y integer Complete the following branch-and-bound tree. Insert -o for infeasible problem objective function. Branch on x first and show the branching constraints used. Use only the boxes you need and mark unused ones with large X. Indicate fathomed problems by double line under their boxes. LPO Objective function-4 x-05, y-1 LP 2 LP 1 Objective function- Objective function= LP LP LP LP Objective function- Objective function- Objective function- Objective function- Optimal solution is: Value of optimal solution:
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Types of trees
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education