On Optimality and Duality Theory for Optimization Problems

Kumar Rahul

$57.95 $49.55

Paperback

Not in-store but you can order this
How long will it take?

Availability Information

We source books from suppliers in Australia and overseas. For books we don't currently have in stock, the time it takes to get them from our suppliers can vary widely - from a few days to a few months - so we check each book with each supplier to determine the expected time it will take to be supplied to us.

We then advise you accordingly. If the time taken to get any book is too long for you, you can let us know and we will cancel or adjust your order, and refund as required.

To find out the anticipated arrival time for specific items prior to ordering, please contact us by phone or email:

Phone +61 2 9264 3111, or 1800 4 BOOKS (1800 4 26657) if outside Sydney:
option 1 Abbey's Bookshop (Crime, History, Science, Kids & more) • info@abbeys.com.au
option 2 Language Book Centre (ESL & Foreign Languages) • language@abbeys.com.au
option 3 Galaxy Bookshop (Sci-fi, Fantasy, Romance, Graphic Novels) • sf@galaxybooks.com.au

QTY:

English

Independent Author
14 March 2023

Information theory; Mathematical theory of computation; Machine learning; Information architecture

Summary
Details

dual model corresponding to given primal problems and some duality results were

piled up in Section 1.4. In Section 1.5, we recall standard minimax programming

problem and present a small overview on the same. In Section 1.6, we introduce a

short note on saddle point optimality problems. In Section 1.7, we present basic concept

of multiobjective optimization problems and its solutions. Section 1.8 recalls

constraint qualification in multiobjective optimization problems. In Section 1.9,

scalar and multiobjective semi-infinite optimization problems is introduced. In Section

1.10, we remind definitions of Lipschitz and locally Lipschitz continuity. Section

1.11 presents definition, basic properties of convexificators and recalls generalized

convexity in terms of convexificators. Sections 1.12 is all about brief literature on

semidefinite programming problem and related concepts for further use. Section

1.13 presents short introduction on vector variational inequality. Finally, Section

1.14 includes basic details of mathematical programming with vanishing constraints

and its literature.

By: Kumar Rahul
Imprint: Independent Author
Dimensions: Height: 229mm, Width: 152mm, Spine: 7mm
Weight: 181g
ISBN: 9781805247562
ISBN 10: 1805247565
Pages: 116
Publication Date: 14 March 2023
Audience: General/trade , ELT Advanced
Format: Paperback
Publisher's Status: Active