• Tidak ada hasil yang ditemukan

Problems on Linear Programming

N/A
N/A
Protected

Academic year: 2018

Membagikan "Problems on Linear Programming"

Copied!
7
0
0

Teks penuh

(1)

Problems on Linear Programming

(2)

Soal 1

• The Munchies Cereal Company makes a cereal from several ingredients. Two of the ingredients, oats and rice, provide vitamins A and B. The company wants to know how many ounces of oats and rice it should include in each box of

cereal to meet the minimum requirements of 48 milligrams of vitamin A and 12 milligrams of vitamin B while

minimizing cost. An ounce of oats contributes 8 milligrams of vitamin A and 1 milligram of vitamin B, whereas an

ounce of rice contributes 6 milligrams of vitamin A and 2 milligrams of vitamin B. An ounce of oats costs $0.05, and an ounce of rice costs $0.03.

(3)

Soal 2

• A company makes product 1 and product 2 from two resources. The linear programming model for determining the amounts of product 1 and 2 to produce (x1 and x2) is

maximize Z = 8x1 + 2x2 (profit, $) subject to

4x1 + 5x2 20 (resource 1, lb) 2x1 + 6x2 18 (resource 2, lb) x1, x2 0

(4)

Soal 3

• A company produces two products that are

processed on two assembly lines. Assembly line 1 has 100 available hours, and assembly line 2 has 42 available hours. Each product requires 10

hours of processing time on line 1, while on line 2 product 1 requires 7 hours and product 2 requires 3 hours. The profit for product 1 is $6 per unit,

and the profit for product 2 is $4 per unit.

(5)

Soal 4

Solve the following model using the simplex

method.

minimize

Z

=0.06

x

1 + 0.10

x

2

subject to

4

x

1 + 3

x

2 12

3

x

1 + 6

x

2 12

(6)

Soal 5

• Solve the following model using the simplex method.

minimize Z = 8x1 + 2x2 + 7x3 subject to

2x1 + 6x2 + x3 = 30 3x2 + 4x3 60

4x1 + x2 + 2x3 50 x1 + 2x2 20

(7)

Soal 6

• Solve this model using the simplex method. Y is your last student number (NIM). If your last

student number is 0 then Y is 10. minimize Z = 3x1 + Yx2 (cost, $) subject to

3x1 + 2x2 18 (production time, days) x1 + x2 5 (contract, tons)

Referensi

Dokumen terkait

Penelitian ini mengembangkan model fuzzy multi objective linear programming yang merupakan modifikasi dari model multi objective linear programming untuk menyelesaikan

Untuk metode modified simplex pada contoh kasus ini memiliki 5 iterasi, lebih sedikit jika dibandingkan dengan iterasi metode sequential linear goal programming dan solusi yang

This version of the problem seeks to identify both the objective function coefficient vector and the constraint matrix of a linear programming problem that best fits a set of

Roughly speaking, the linear programming problem consists in optimiz- ing (that is, either minimize or maximize) the value of a linear objective function of a vector of

edu.my ABSTRACT In order to develop approaches to solve a fuzzy linear programming problem, it is necessary to study first the formulation of membership functions and then the

Fuzzy linear programming coefficients in an uncertain with vague objective environment Abstract In this paper, a new fuzzy linear programming FLP-based methodology using a specific

1.4 Scope This study emphasizes the use of Weighted Goal Programming WGP model as well as the Linear Programming LP model to examine budgetary manufacturing process and improve the

The stages of establishing a diet menu problem model based on the Boolean Linear Programming approach are carried out as follows: examine the problem, determine the notations, indexes,