Multiple Objective Decision Making Methods and Applications

Name: Multiple Objective Decision Making Methods and Applications
Brand: Springer Nature
SKU: 9783540091110
Availability: InStock

Best Price (Coupon Required):
Buy Multiple Objective Decision Making Methods and Applications for $36.00 at @ Link.springer.com when you apply the 10% OFF coupon at checkout.
Click “Get Coupon & Buy” to copy the code and unlock the deal.

Set a price drop alert to never miss an offer.

1 Offer Price Range: $39.99 - $39.99

BEST PRICE

Single Product Purchase

$36.00

@ Link.springer.com with extra coupon

Price Comparison

Seller	Contact Seller	List Price	On Sale	Shipping	Best Promo	Final Price	Volume Discount	Financing	Availability	Seller's Page
BEST PRICE 1 Product Purchase @ Link.springer.com		$39.99	$39.99		10% OFF This deals requires coupon	$36.00		See Site	In stock	Visit Store

Product Details

Brand

Springer Nature

Manufacturer

N/A

Part Number

GTIN

9783540091110

Condition

New

Product Description

Decision making is the process of selecting a possible course of action from all the available alternatives. In almost all such problems the multiplicity of criteria for judging the alternatives is pervasive. That is, for many such problems, the decision maker (OM) wants to attain more than one objective or goal in selecting the course of action while satisfying the constraints dictated by environment, processes, and resources. Another characteristic of these problems is that the objectives are apparently non commensurable. Mathematically, these problems can be represented as: (1. 1 ) subject to: gi(~) ~ 0, ,', . . . ,. ! where ~ is an n dimensional decision variable vector. The problem consists of n decision variables, m constraints and k objectives. Any or all of the functions may be nonlinear. In literature this problem is often referred to as a vector maximum problem (VMP). Traditionally there are two approaches for solving the VMP. One of them is to optimize one of the objectives while appending the other objectives to a constraint set so that the optimal solution would satisfy these objectives at least up to a predetermined level. The problem is given as: Max f. ~) 1 (1. 2) subject to: where at is any acceptable predetermined level for objective t. The other approach is to optimize a super-objective function created by multiplying each 2 objective function with a suitable weight and then by adding them together.

Available Colors

N/A

Available Sizes

N/A

Reviews

0 reviews

5 stars

4 stars

3 stars

2 stars

1 star

Questions & Answers

Similar Products

Juega con cuidado!

$5.96

A Violent World

$32.99

Passive and Active Measurement

$84.99

Wolfram

$54.99

Advances in Sustainable Construction Materials

$169.99

Krperunzufriedenheit bei Mdchen im Jugendalter

$84.99

Library Lion

$5.96

Wavelets and Subbands

$54.99

Amazing Scientists: The Doctor with an Eye for Eyes

$5.96

Data Science Training - Supervised Learning

$29.99

Web Services ICWS 2021

$59.99

Decolonising Blue Spaces in the Anthropocene

$59.99

Numerical Range of Holomorphic Mappings and Applications

$99.99

Applied Corporate Finance

$74.99

Hormone Therapy in Breast and Prostate Cancer

$89.00

The "I Love My Air Fryer" Cooking for One Recipe Book: 175 Easy and Delicious Single-Serving Recipes, from Chicken Parmesan to Pineapple Upside-Down C

$17.99