linear programming problem, Operation Research

Assignment Help:

A paper mill produces two grades of paper viz., X and Y. Because of raw material restrictions, it cannot produce more than 400 tons of grade X paper and 300 tons of grade Y paper in a week. There are 160 production hours in a week. It requires 0.20 and 0.40 hours to produce a ton of grade X and Y papers. The mill earns a profit of Rs. 200 and Rs. 500 per ton of grade X and Y paper respectively. Formulate this as a Linear Programming Problem.

Related Discussions:- linear programming problem

Least cost method , definitions procedure and example

definitions procedure and example

OR models, Explain why it may be advantageous to build models to help in so...

Explain why it may be advantageous to build models to help in solving a decision problem.

Inventory Control Model, 1. A local university purchases exercise books to ...

1. A local university purchases exercise books to give to their students. Instead of a fixed unit cost, their supplier quotes the following discount pricing: Order quantity Unit P

Simplex method, how to use simples method

how to use simples method

Decision analysis models, These models deal with the selection of an opt...

These models deal with the selection of an optimal course of action given the possible pay offs and their associated probability of occurrence. These models are broadly

Both LP and PIP, marginal rate of substitution, degeneracy and degenerate ...

marginal rate of substitution, degeneracy and degenerate solution

Attitude measurement and methodology , Case Study - Attitude Measurement ...

Case Study - Attitude Measurement National Kitchens For several years the management of national kitchens a diversified packaged foods manufacturer had been watch

Scope of operation research, scope of operation research in management

scope of operation research in management

Linear programing, Solve the following Linear Programming Problem using Sim...

Solve the following Linear Programming Problem using Simple method. Maximize Z= 3x1 + 2X2

Problem formuation and model building, nature and types of problems

nature and types of problems

Write Your Message!

Name

Email id

Message

Verfication Code

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

Submit Assignment

User Account

All Pages